Sunday, January 13, 2013

Installing Rocks Cluster on time travel one station.




This blog copyrighted (c) 2008 - 2014 timetravelinstitute.biz 


This weekend I have largely just worked on my parallel computer. I downloaded Rocks cluster from
  http://www.rocksclusters.org/ and I was really surprised at how easy it was to setup a cluster with it and how good the installation would be. I went ahead and downloaded every thing. Some where around 24 iso images in all or I guess around 12 gig. So, to make a long story short I did not want to go out and spend 20 to 30 bucks for cds so since I am real inventive I had some tricks up my sleeve. I installed virtual box on my ubuntu then created a virtual machine. I then mounted each ISO image one by one from the hard drive to install rocks cluster in virtual box.

Oh it gets much better. I created a second virtual disk and partitioned it and formatted it then I used clonzilla to clone my virtual box cluster to a image on my second virtual disk. At last but not the least I created a share on my 2 terra byte USB drive then copied the clonzilla image to my 2 terra byte drive. It was around 8 or 9 gig in size. Then last but not the least again I booted my pc-desktop up into clonzilla and cloned my rocks cluster image to my pc hard drive thus converting my virtual machine to a real computer operating system.
Now there was some things I had to do to help convert the virtual image so I could use it with clonzilla but I will keep it simple in layman terms and stop here.

So in the future if you dont feel like burning all them dang cd's just mount the isos to get at the files or install the iso's on a virtual machine (which allows mounting iso images as cd/dvd's from the hard drive) then image it then clone it to the target machine. Works good.

I have some new things with my time-travel code I wont to try out with the rocks cluster and I needed a more permanent, powerful cluster with more stuff than I am normally used to. Well I have a lot of time-travel media to pick thru this morning and I have a lot of coding to do so I am off to it. Just thought I would drop everyone that little trick.

Oh, I was at the fake timetravelinstitute.com on of their accounts probably was a fake account used by Ray aka Rainman or his flunkie Star Lord aka Darby anyway I again explained how my stuff works. Here is a quote from my post.

"As I explained in layman’s terms what I do is arrange numbers from 0 to 255 in a specific order as binary bytes that a computer can see as a computer media file that has the chance of being a computer file of the future or the past or a computer file from the future or the past.

The way I do that is use check-sums (numbers that represent computer files. There are many ways to calculate those numbers but my numbers have to be hackable. Hackable means it is possible to take that number and reconstruct the file. So with those check-sums I can extrapolate or plan ranges of those numbers that time travel media will be in. Then I take one specific check-sum and Roll it to get every possible combination of bytes in that check-sum. (That is where arranging the numbers in order come into.) to get the possible files in that check-sum. That is also called searching the check-sum collisions. One of the previous people I talked to on another forum if I had his name I would say it he had a problem with check-sum collisions. He did not like the fact that I had collisions. Collisions are checksums for files that are the same. Anyway I search those check-sums for time-travel media then move on.

Now, what is important here is to make those collisions go in a specific numerical order and to control how fast that order changes. I use 1 minus the base to control that order but it does have its draw backs. Not every calculation will be the same check-sum and adding or subtracting 1 minus the base or its multiples has to be done in a spacial way.
Now with throttling the counter (controlling its speed) we can control how fast we find time-travel media by controlling how much or how little we add to the counter . We use addition or subtraction to the counter to control its speed. The counter may be a list of numbers 0 to 255 but by using base 256 we can perform addition or subtraction to the counter to control it. We either add or subtract to keep the counter its same check-sum but make the order of check-sum collisions go up or down in a numerical fashion. Also, we can change up the algorithm and use the speed of the counter to make the counter intentionally go up or down in its check-sum measurement. I have trained a neural net to control the speed of my counters I also have graphed information in the counter to use as clues or switches when to chance the speed of the counter as it finds time travel media so the counter can roll to computer media of the future or the past. If you try a brute force attack to find time-travel media you are very limited as to the size of the files you can find but by my way of controlling the speed of the counter in a numerical fashion as it turns it speeds up the process in a manageable way on a machine that is limited in is capability. You just have to give the program the ability to roll the counter backwards or forwards and slow the counter down or speed it up and completely stop the counter when it has found a time-travel file. Then save that file out to disk.

Also there is way more to post that I can not post here like media file formats and how to detect them. Graphing information in files and comparing that information to variables. Statical search techniques. AI processing. Parallel and Symmetric multiprocessing and much much more.What I do is not easy and is a lot of work."

-------------------------------------------------------------------------------

update 6/6/2013

Traffic is slowing down now so I converted my last two and best two post back to drafts. On my rocks cluster later I went back and completely redid it updating it in the process. It has windows on the front end of the hard drive. Ubuntu runs from the windows partition but has a boot loader. Rocks, surprisingly runs from the Ubuntu boot loader.

Rocks has its own partition. My Alienware is a node of rocks and nothing but rocks runs on it most of the time. Now, my Alienware is cloned so I can recopy its orginal operating system back over  depending on my mood. I have two images. I keep a updated Rocks node image and a update windows image and I just  switch images when I need to go back to windows or back to rocks on my Alienware which ever strikes my fancy. I use clonzilla  for imaging. To me there is no other for cloning.

I maxed my rocks cluster out on  hard drives which are not normal IDE drives. No, their the top of the line stuff. So, my specs again are

32 gig memory
AMD FX(tm)-8120 Eight-Core Processor
many terabytes of hard drive space.
AMD Radeon HD 6700 series video card - Im running two monitors

In this I have my playstation 3 which is on a switch so I can switch from my computer back to my playstation3 on the monitor's and speakers. I did have a tv card on my computer  but now I have a real tv so the card is put up except for recording video to my computer off tv which I still do from time to time.

From my windows I keep my rocks and its hard drives encrypted when not running my time-machine. And my windows is encrypted too. So, if anyone drops in good luck to them. The NSA could probably bust my encryption if they wanted to. There aint much they  can not hack when they want. But, I am probably safe from local trouble. Keeping the drives encrypted comes at a high price though. When I want to do a time-machine run it takes many hours of decoding the drives then when I am done it takes many hours to encrypt them again.

 If the system goes down during that time im screwed but I always keep a trusty clone image ready to go before I encrypt. If my encryption goes ok I destroy the the clone image. Im thinking about moving my system all together away from my home because anymore I wont let my software run if I am not home like I use too. So, now days I have to plan in well in advance for my time-machine runs.

That is where I am now days. I guess I should take pictures sometime and post them. Gone is my old system that people normally see when they read my blog. Its just my big black box and my Alienware now. In all I have 16 cpu's which run a lot faster than my old setup.

Monday, January 7, 2013

Space.com ran a article.


This blog copyrighted (c) 2008 - 2014 timetravelinstitute.biz 




Well these last two days space.com ran or should I say parroted a article how time-travel is possible with computers. I was on youtube.com and came across a video from the series through the worm hole with Morgan Freeman that at the end said time-travel is possible with computers and possibly the easy way to time-travel. Well I went back to the fake timetravelinstitute.com and posted how I was proud of space.com for running their artical it showed they have growed up. Darby came in and posted and like a coward made his post invisible to me which I saw when I was not logged in. Then the coward went back after I responded and deleted his post and posted it again edited under my post.

Well by now they know I am right Im sure in his mind that is the only way he could get at me for rubbing his nose in it. And sadly to say when I posted the video link at the fake timetravelinstitute.com them cowards went back and knocked my link out so I went back and edited it and reposted it.

So lets play Darby in the box. Here is a picture of his post hidden to me.



And here is a picture of Darby out of the box. Where I was not logged in and his post was visible to me.



You know when I first went to that site those guys claimed to be men of science but after all their petty chasing me and fooling with me to keep my views and theories from the public these guys are only making fools of themselves.

Here is the link from youtube.

Time travel video at youtube.

The point of this post today is that this week I have seen a public awareness that computers are a viable method and form of time travel. Now Morgan was talking about the far future when mankind could simulate a society like on matrix. The type of time travel I do is by using check-sum hacking to search check-sums for files from the future or the past. To recap:

A check-sum is a number that represents a computer file. 

Putting 0's thru 255 in a specific order creates a computer file that computers can read as computer media. That can be videos, pictures, ect....

What I do is use a check-sum(a sum of the numbers 0 thru 255 added up into one number) to find ranges of check-sums that computer media from the future or the past might exist in.

Then using the algorithm 1 minus the base I add this number to a series of numbers 0 to 255 to keep its check-sum the same but work thru every combination of files for a specific check-sum. I can also add multiples of 1  minus the base to make the counter go faster. I call this throttling the counter.

I used search bots to search the files that the counter creates for time travel media. It is a very simple idea but a lot of hard work to program. In fact I have spent these last few years writing and testing the programs that make my form of time-travel possible which Morgan Freeman on "Through the worm-hole" said was a valid form of time-travel and researchers on that program scientist backed him up. Morgan said men would use computers to recreate the future or the past and I do use computers to recreate the future or the past in computer media that I can see, hear,  and read. Well that is it for today it is way past my bed time.

02/13/13
In edition to the space.com article and through the worm hole with Morgan Freeman on time travel with computers Science Daily ran a article with time travel with computers for reconstructing ancient languages. http://www.sciencedaily.com/releases/2013/02/130212112025.htm

Thursday, December 6, 2012

5th Dimension simulator


This blog copyrighted (c) 2008 - 2014 timetravelinstitute.biz 

Well after using my old equipment for a long time I finally ordered me a 8 core 3.1 gigaherz cpu and decided to upgrade. No it wont be windows 7 nor 8 nor any version of windows. I spent some time working on my AI and now I am upgrading and rewritting that too.

I was going to use it for the Darpa virtual robot competition but with work and all I would not be able to keep up and it is mainly for teams so that kinda counts me out I would be working by myself. I pre-registered for the competition but will not pursue it farther. I believe Darpa has more to loose from me not pursuing it than myself because my AI is made for production work, very quick learning, scalable, adaptable, programmable and deprogrammable. Its neural net data base can be searched like a data base because it is a data base. You cant do that with a human. And it can learn multiple task besides being able to store a hell of a lot of learning and information. I will insert it in a bot of my own later on down the road. I got my own back propagation training program for it. For the bot Competition I was going to have to train it like you train a child. But this child would instantly learned its training. Then the training programs would have to be together in series as a full program training course down the road so new bots could just come in and learn what they need then hit the road to be used. And now I am Up to recurrent neural nets instead of feed forward. I found when training something that complex it has to be really fast and store a heck of a lot of information and learn really fast to be of any use to anyone.
But the AI should do a fair job of keeping up with my counters and operating them for me if needed and more importantly finding my time travel computer media of the past or the future. That is once I am done with upgrading it, again. To start with the AI stores and retrieves its learning from a parallel scalable data base that works with complex tables to look up information. That is what makes it fast. A master node directs slave nodes to collect input, process that input as a neural network, then pass the output from the neural net to an application that takes the output and uses it or discards it. The input application in my case is my counters. Or in a robot would of been the application collecting input from the sensors. I posted my plans for this AI a long time ago at the fake timetravelinstitute.com but those post have long been deleted. All of this can run across multiple computers with a simple network. In my case two computers with 8 cores each for a total of 16 cores.

It has been a heck of a lot of work too. It really cuts into my tv time doing all this programming. And as always im still experimenting continually with my counters. So long story short I will have my alienware laptop with 8 cores and my homebuilt computer with 8 cores.

Lately I have been calling my programs a virtual 5th dimension simulator. Because when everything is up and running that is what my programs do. Simulate the 5th dimension for the purpose of finding time travel computer media of the future, past, or an alternate reality. Again as I go across the internet posting on forums people tell me computers are too slow for that. Programs cant be wrote to run that fast. And I just scratch me head, shake my head in disbelief because I am doing it and have been doing it for a long time with nothing more than a few junk pcs in parallel. Im like what? That has never stopped me. For one with text it is not that hard even on a regular computer depending on how much text you want to use.

Then there are my methods where I store large amounts of information in decodable, crackable check-sums. I can take a weak checksum and a stronger checksum or where I used two different types of weak check-sums that can be decoded and cracked and I take those checksums and embed them into text messages between myself in my current reality and my other selfs in the future, past, or alternate realities. Myself and my other selfs know how to decode, crack, and hack these check-sums to recreate the larger files from other parts of space-time to get the much larger pieces of information out. So I dont need a big counter.

Now as I explained the other day again for the 1000th time to someone I can control the speed of my counters by adding small numbers to them or big numbers to them. And as information comes into view slow the checksum counter down to bring the time-travel information into view or even reverse the counter and back it up like viewing a vhs tape . Here is a little example of throttling a binary counter.

Im just using base 10 here to make it simple to understand.
357 = 3 + 5 + 7 = 15 as a checksum.
+ 9
----
366 = 3 + 6 + 6 = 15 as a checksum.

or if we want to speed it up 15 steps 9 * 15 = 135

357
135+
-----
492 = 4 + 9 + 2 = 15 as a checksum.

Now we just skipped our counter forward 15 steps. Now when adding as I do to run a rolling checksum counter there is a little more to this but to prove my point yeah buddy we can throttle the hell out of binary rolling checksum counters and speed them up to find time-travel media.  We can make the counters equal computer media from the past or the future of a known checksum for decoding purposes. Or we can search unknown check-sums for searching the counter for valid files. Now here in this example the counter is giving all the same check-sums but the check-sum collisions as they are called are searched to see if they are valid files. And for searching these files for valid time-travel media yes I use a AI but I also use a distributional curve of information which I can used to validate a possible file. And also again as I may have mentioned before the file format as a way to validate a possible file and also last but not least directly searching the file for information using a search query or a template. Their are many ways to do what I do.

And again I can just work with 1's and 0's too. I can have a check-sum for the 1's and a check-sum for the 0's. I can put these checksums in a higher number base other than 10 like 255 or higher to make the check-sum smaller. And with two check-sums and my counters running in decoding mode when the check-sum for the zero matches and the check-sum for the 1's matches I know I have found my time-travel media. I use this some-times to decode or encode computer media to myself from the future or to the past that I send myself. Time-travel media like movies, tv news shows or what ever. I put theses check-sums in messages to myself from the future to "time-email" myself time-travel computer media. My messages start off pretty much like this paragraph just words telling myself what has happened in the time-line then send myself a movie, news program, or other stuff as a check-sum to decode.

2839292389989 90238338734 x255 avi 8mb (this is a simple example how I would embed a file to myself from the future. The first number would be the 0 checksum, the second number would be the 1 checksum the base that it is in and the file format then finally the length of the file. I would read the message manually then type these numbers into my counters to decode the file.

So to update my form of time-travel. My computer code is a 5th dimension simulator used to search for and find computer media of the past or the future. Our to be more precise its a 5th dimension simulator for the purpose of time-hacking.  My 5th dimension simulator becomes a fixed point across the space-time continuum. The keyhole which intersects many other quantum realities. In quantum machanics for any event there is a infinate number of possible outcomes. Our choices determine which outcomes we will follow. But their is a theory in quantum physics that all possibilities that can happen do happen in alternate quantum realities. So in theory every reality my 5th dimension simulator finds is a real quantum reality. And in theory my form of time-travel is valid and holds true.

The other day I posted on a forum that I am the most dangerous hacker in the world right now. Because with a proper profile of the computer media I am looking for I can get information off other computers without ever connecting to them. Without even connecting to the internet. And if the time between my actual time and the media I am looking for is close the media can even be current or up to date. With my 5th dimension simulator all I need is a profile of the data I am looking for. The data can be anything anything at all.
Being able to use and access the 5th dimension is way more powerful for hacking when it comes to obtaining information. That is why I am the most dangerous hacker in the world. Im the only hacker using the 5th dimension. And its legal because I am not physically connecting to other computers. And in the process no one can claim I damaged their computer or owe them money because they had to change their security.

As for my CIA agents I have largly gone unchallenged on the other forums for a while now. But they are still attacking my forum thetimetravelinstitute.com.
I posted a link on my timetravelinstitute.biz to my forum. My biz sight needs a lot of updating my forum is pretty current. Darby took down his old forum so I have been told. The Rainman was gone for a while doing something else but now he appears to be back at the fake timetravelinstitute.com. They completely redid their forum. It was about time I was so tired of those guys copying me. So now our two forums dont look very much alike any more.

Someone the other day wanted to know the specifics on my parallel computer. Well in the past I have used a bunch of boot up cd's or dvds to quick and dirty boot up a parallel computer. To name a few here is my list.

Chaos - a real easy to use parallel system.
openssi knoppix
pelicanHPC
ABC linux automated cluster
cluster knoppix
Kerrished Live

My version of linux: Ubuntu and I,ve used fedora, suse, lfs.

And I do recommend setting up a beowulf for a more permanent parallel computer. Im currently doing that with my new system. It is easy to do you just need a few applications

Linux that you can use as a server
NFS (network file system)
SSH
and a message passing interface.

In the past I have used PVFS now it is PVFS2. And a lot of my programs use tcp/ip instead of a mpi and a lot of times I have my code fork and thread to get my stuff going in parallel. If you dont program you may not know this stuff.

And by the way parallel programming code can be hell to debug. Well their I go explaining my trade. A lot of people get mad at me for not showing proof but if I show them a video I get called a liar. If I give them a picture I get called a liar. So anymore I just talk if they dont listen oh well. And I have found that what makes people the madist at me is when I give them the proof they want. I show them by example how I do something. Then they cant prove me wrong but they still try. It is a pride thing for them. Now In Ray Hudon's case aka rainman or RMT (retared muted toad) for short and Darby of Darbyshire them sons of trolls are disinformation agents. It is not about being wrong or right it is about keeping knowledge away from the public. No, time-hacking is a true form of  time-travel and hacking at its purist form (A purist is one who desires that an item remain true to its essence and free from adulterating or diluting influences.) Yes, hackers can be purist too. The time-line can be hacked. And I am a professional time-hacker. And I believe all knowledge should be free to the public. It is why I started this project a long time ago. To collect information, knowledge, and technology.  If I got wrote a ticket every-time I have actually violated causality I would be in prison right now for thousands of unpaid time-violation tickets. But I live in America. I can get away with it here.

Before I start my next paragraph my two favorite people in physics are 1. Stephen William Hawking 2. John Hutchison.
 And last a while back I talked about  my interpertation of gravity. Ok well today I wanted to bust the UFO coverup bubble. Here is how they fly. Everyone remember the Hutchinson effect by John Hutchison (This dude deserved way more credit than he got. He deserves the Nobel prize in physics for his discovery. but because of his income, education, profession, and the importance and military classification  of his discovery he was denied the proper credit.)  He had like 4 Tesla coils around a object any object then he used a dish to aim EMF at the object. Well the High voltage was regulating the speed and distance of the electrons around their nuclei (basicly controlling the nuclei energy state) the atom was in sync or in phase with the incoming emf. If everyone remembers how emf propagates it goes negative -, positive +, magnetic north, and magnetic south then repeats all over again. Well atoms are also negative, positive  north and south. So, this set up the guass gun effect. The atoms repelled and attracted to the emf electromagnetically setting up a simulated gravitational effect. Also as you remember he melted metal thru wood at cold temperatures  That is because the electrons got pulled far away from their atoms during Hutchinsons experiment. So, The UFO's do the same thing. Control the speed and distance of the electron around the nuclei with high voltage and use emf to put the matter in phase with the EMF. Now using the phase of the EMF with matter can make a UFO repel or attract. Keep in mine I am trying to keep this simple. The voltage and also has a current and frequency used to control the energy state of atoms. But I am explaining this in a simple manner. Remember Bob Lazar. He said the UFO modulated a gravity beam underneath the ship to pull it forward or push it backwards against earths gravity. At the cafeconspiracy forum Darby aka starlord deleted one of my pictures when I tried to show this example.

THAT IS HOW UFO'S FLY. THAT IS THE COVER-UP AT AREA 51. THAT IS HOW THEY GET ACROSS THE UNIVERSE. Basicly using voltage and EMF they make their ship act like a guass gun and with control of gravity they control time and inertia so they can do all them fancy tricks. I also read somewhere they spin a magnetic liquid at incredible speed around the tube on the inside of the ship to create a gravity effect. It would create gravity if it was fast enough using the theory of relativity. It would also create a gyroscope effect for maintaining orientation of the ship. So in theory it would at least be needed for stable low speed flight.

Update - Using the Hutchinson effect with deuterium and  flux compression generators or other energy source: In  a round metal container the outside layer of the round container would be the Tesla coil and the inside would be 2 to 4 EMF dishes all pointing to the center of a round container filled with deuterium. If my calculations are correct and im sure they are and if the frequencies and phases of the tesla coil and the EMF dishes is correct this would either create a fusion reaction and if the power is high enough a fusion explosion. This is so because it would be acting as gravity does in a star on the deuterium. How this power is harnessed of course is up to the users skill, knowledge, and intentions.

Update - I have my new computer built. It is running 8 cores 3.1 to 4 gigaherz depending on how I clock the bios with 32gig of memory. I have a AMD unlocked 8 core processor with  a ASUS sabortooth motherboard. I only have a 1 terabyte hard drive now but that will change. Its all sata now and I have USB 3 which is nice. And I have a blackwidow keyboard and rocker gaming chair of course with it. My video card is capable of 3 monitors its DDR5 1 gig I will upgrade again later. So with my alienware laptop now I am running 16 cores which was my orginal goal 16 cpus.  With all the extra memory I run my counters from memory now instead of the old way which was a mixture of memory and hard drive space too. Now my hard drive space is only used for writing out found time-travel media. Getting that 32 gig memory up was a b***. For a while I was only getting 8 or 24 gig up I really had to play with putting the memory in and out of the slots before I got the computer to see it all. Which explains why when I buy a computer and check the memory it is not always running what I paid for. Lazy techs and lazy builders. Well im off to explore the space-time continuum.

Saturday, June 30, 2012

Well I may end up repeating some of what I said.


This blog copyrighted (c) 2008 - 2014 timetravelinstitute.biz 

Well I may ending up repeating some of what I said in the past but also there will be some new stuff to tell. I have been posting occasionally at the old fake timetravelinstitute.com. The trolls there changed their web-sight which I am grateful for that because I want as much difference between their fake site and my real http://thetimetravelinstitute.com (the sight that I own). They have been stepping up their attacks against me at their fake site no doubt for the eventual planned expulsion of me again. As I have repeatedly told those guys I am immortal on the internet. So what I have done lately. I have been working on my IA to search my time travel media files. The computer code for that AI can be found at my web-sight http://thetimetravelinstitute.com . I also have been writting more counters which I may or may not release to the public just yet. I have expanded my theory a little. And of course my experiments continue with time travel with information and data mining information from binary counters. Here are copies of some of the post I have made lately else where.

"That using advance computing we can now data mine for information instead of inventing it and even  decipher information itself out of time and space. What I said this morning was that there is more than one way to run a check sum counter to do this. In my methods I previously showed that we could run a counter like this using bytes from 0 to 255.

127 8 9 = 127 + 8 + 9 = 144
126 9 9 = 144
125 10 9 = 144
124 11 9 = 144

These numbers would represent a file on a computer. The check sum counter when it could no longer run would give a carry to the next numbers over to the right and the sum would be distributed to the left to equal 144. As we run this counter we would data mine the file for information be it time travel computer media or knowledge.

Now we could also run a binary file like this

1100 = 3 in binary but the check-sum would be two zeros and two ones.
1010 = 5 in binary but the check-sum here again wold be two zeros and two ones.
0110 = 10 in binary but the check-sum here again would be two zeros and two ones.

While I am on the topic of this counter how would it run. It would run like this: For this example I will use 1 binary 1 check-sum for the ones and 3 binary zeros the three is the check-sum for the zeros. Here it is.

1000
0100
0010
0001

You see we take a specific position in the binary file and swap it with the next position in the file. Then we do that again and again till we reach the end of the file. Then we go back to the beginning of the file and do it all over again. This we with a specific count of binary ones and a specific count of binary zeros we run thru every combination those ones and zeros can have in the binary file. Thus ( a new way to run a check-sum counter with binary. )

Now we could use many methods to data mine these files. The simplest method would be to mathematically plot the distribution of information within the files. Now the distribution for information is different than the distribution for random numbers. Also the same distribution for two different pieces of information  could look the same. What it would tell us is that there is information there. Now what we would look for is the distributions to prove we have indeed uncovered information then we would look at the information itself. You see the information itself would be different. If we are seeking specific information we just look for the information itself (information finger print) that was plotted with the distribution curve. So that is the easy way to search a check-sum counter for information or time travel information."

"Now with brute force check-sum counters we will eventually come up on the information we are searching for. We will also miss lots and lots of other information that we might of found useful or interesting. You see, it is hard to save all the useful information in the universe. Techniques I use is to write messages to myself in the future and in the past. Get a finger print of the information in my messages then get a range of check-sums from all my messages to establish the check-sum range I am communicating with myself in. Then run my counters only within those check-sum ranges while looking for a distribution curve or curves that my messages have then checking those messages for my information finger print to find messages I will write to myself in the future or that I wrote to myself in the past. You see information has no mass. It can travel thru time and space very nicely with no problems. My methods create sort of a 5th dimension to search for time travel media which makes it fit the laws of physics quite nicely.

Now what if we are not looking to use brute force counters. Why not use random counters. We can indeed use random counters but the distribution curve for the information within the files will be different. What we have to do is force a distribution curve on the information that we are writing to a file. More or less filtering the noise out of the random counter. We use a probability map or probability filter if you will that we pass the numbers from the random counter thru. If the numbers being generated and written to the file are within the distributional curve of information we let those numbers get written to the check-sum file. If not those numbers are not written to the file. Now we can still get a file that is jiberish. Now what we do is for a syntax filter on the information from the random check-sum counter. If the information being generated from the random check-sum counter both passes the distribution filter and the syntax filter then now it is allowed to get written to the check-sum file that will be searched for information. If it does not pass the syntax filter then it is not allowed in the file.

Now we can use our AI or other data mining techniques to verify the file that we deciphered out of space and time."

The subject that I do using information theory to data-mine for technology instead of inventing it and decryption of computer media of the future or past out of space-mine is a staggering topic and as I have found over the years really hard work. What I would love to one day see is like China, Japan, or Russia using their massive super computers to validate my work. In the USA there is not much interest in what I do. Im hoping somewhere some day some real computer power will be put into this. If I can accomplish what I do on my alienware computer at home with my communicating with myself in the past, future, or alternate time-lines just think what could be done with real computing power.

Sunday, July 17, 2011

Catching up



This blog copyrighted (c) 2008 - 2014 timetravelinstitute.biz 

I have been locked out of this blog and I dont know how that happen. I have so very much catching up to do. For starters the conspiracy against time travel and myself that includes Darby of Darbyshire and Ray AKA Rainman using different user names to try to discredit me at different forums. My latest forum was conspiracycafe.net. The owner of that site trashed my account but did not bann me. Long story short my account was too messed up to post anymore. A form of being banned.

I have a video now out on youtube. It will be under reactor1967. Well summer is comming to a end. I am about to get back to some programming. On my code this summer I worked with running a counter where it ran not only in the weak check sum collisions (collisions mean running and staying the same check sum but different files.) But also running and giving weighted check sum collisions. So my counters I did this summer ran at both the same weak check sum and the same weighted check sum which greatly reduced the amount of time to find a result. I found that if you use more than one kind of check sum for the same file and the counter can run giving nothing but the collisions for those check-sums it greatly reduces the amount of time needed to recreate that file with those check sums.

I now call my hobby temporal hacking. Temporal hacking needs both expertise in check-sum hacking and expertise in data mining to find files of the future or the past.

I worked on short-cuts this summer to making my counters run faster. I plan to keep those programs to myself but I will tell you about them.  I developed programs to run a single check-sum counter with different methods for computing check-sums for the same file. A weak check-sum and a weighted check-sum. Let me tell you developing algorithms for running a single check-sum counter giving off collisions for two our more check-sums representing the same file was pure hell to put it nicely. I really had to rack my brain. What I found was that if you take a file and change it so that it still represents more than one check-sum then as you change the file patterns will develop that can be saved and used later to run the counter.

So what I basicly did was run a counter using only one or the other check sum then when the counter equaled both check sums I saved the counter out to a file. Later I went back and looked at these files and found ways I could run a check-sum counter giving off collisions for two different check-sums. Now this method was used for the weak and weighted check sum. I did not use any strong check-sums but if I could have done it I would of made the process of reconstructing a check sum to a file even faster.

Anyway using a rolling check-sum counter giving off collisions for more than one check-sum is a faster way to recreate files knowing only their check-sum or various check-sums using different hash functions. Like I said it did speed the process of recreating files from only their check-sums greatly. But this was all experimental and very time consuming but something that needs to be improved upon later.

So my future work now is to write three programs. One counter program, one data mining robot, and one random number program to create files filled with random numbers. The counter program will randomly fill a file with random bytes and compute the check-sum of the file at the same time.

Then it will randomly add or subtract from the rest of the bytes in the file to bring the file to a specific pre-determined check sum. Then it will then leave this file and go on to create another one. These counter files will be data mined because they are the check-sum collisions off the rolling check-sum counter.

I like to use a random method now because it is a faster optimized way of getting results but the random numbers have to be cryptology grade numbers for this to work. I tested this by using small files first and seeing how long it takes to get all the possible results. This moved to larger and larger files. The larger the files the more this method works. Because the amount of time to find results using a brute force attack is way longer than taking the truly random approach. Some people like Ray aka Rainmain and his cowhand Mr. Darby who have been  two of the disinformation agents trailing me across the internet may disagree with me but that is neither here nor there. Everyone is entitled to their opinions.

Now for this to truly work the random number program has to write files that hold truly random numbers for if they are not random then the counter program will put itself into a loop and we dont want that. So, my random program is ran to create files at specific lengths filled with random numbers then take that file to a randomly selected check-sum by randomly adding or subtracting from the bytes within that file. Then the bytes in the file will be switched around with other bytes. It is the same people I spoke of at space.com and the forum where Tiggs is. This will be are random number file use to run the counter program.

My data mining program will look at the saved counter files to see if they are good. If not they will be deleted. The data-mining is the most complicated part of the process.

So my counter runs and writes files like 1.bin 2.bin 3.bin 4.bin and so forth using random number files devran1 devran2 devran3 devran4 and so forth. It will delete the devran files as it uses them.

There will be some tool programs that can be used with these programs but I have to decide what I want to put with the tool programs. The tools will be programs to help determine what check-sum ranges specific information is in. They will also create and save file formats for the data-mining bots to use. Programs for writting messages, and giving them digital signatures and mac codes and so forth.

I plan to get all three of these programs working for both temporal hacking and check-sum hacking here shortly and I am considering making them available over the internet maybe in a year or two.

So any way I am going to making my programs smaller, faster, and simple as possible. My counter programs will fill up a hard drive with potential files from the future or the past my data-mining bots will search thru those files.

Now I posted a video at youtube In which I said I write messages and give them digital signatures, mac codes (message authorization codes), and what is called a quantum code (one or more events in the time line before the subject of the messages to prove the message is real). These methods go on to shore up my A B algorithm. That if A in the past and B in the future know the weak check-sum range of their messages to each other then both A and B can data mine that check-sum range for their messages to each other thru space-time. Putting in better methods of doing that and tweaking the software around is what I have been doing.


video
(Update- my youtube video disappeared so I uploaded to blogger.)


And last a side note tonight on how to get truly crypto grade random numbers. A stream of video or video and audio from the environment is a good way. TV recordings or recording the tv left on a noisy channel. The video from such a recording can be broken down into small files or used as a whole file. Part of the recording is used for the counter file. Then Part of the file is used by taken a specific number of bits at a time to create a number from 0 to the length of the counter file to tells us what bytes to modify to bring the counter file to a specific check-sum. In this way using an external source from the environment can cryptology grade numbers be obtained. If a video is used instead of a external noise source then I suggest randomly moving the bytes around in the file with a software random number generator before using the file itself. Anyway we are using part of the external source as a counter file and part of it as a random number generator to bring the counter file to a specific check sum. This way we can avoid the mistakes of a software random number generator taken the counter file into a loop and limiting us as to what results we can find. And one more thing. Since we will be using this method to explore different check-sums for time travel media we can also HEY FATSO DARBY IM USING CAPS AGAIN. REUSE THE RANDOM NUMBER FILES. I like to play around with my disinformation agents from time to time. On the forums they go after me for using caps. Well anyway here are some of my secrets in this blog. Ok im done with this post for tonight.

Oh I could not leave without giving out some computer code. This is the code for the program I was talking about. I have been making improvements to it. This is just one program in a very long line of programs I use for time travel hacking. It is new off the compiler so it might need a few things tweeked here and there. More proof of my claims.

#include


#include

#include

#include

#include

#include

#include

#include <\time codes2\mersennetwister.h="" hacking\fire=""></\time>



// declare user space

using namespace std;



// =======================================================================================



long long weakchecksum(string file1)

{

fstream myfile1;

int x;

long long checksum = 0;

long long begin1;

long long count1;

long long count2;

unsigned char buffer;

long long size1;

long long size2;

long long filesize;



myfile1.open(file1.c_str(), ios:: in
ios:: binary);

if (!myfile1)

{

cout << "122608-12:02 am Unable to open for pic file.\n";

system("pause");

exit(1); // terminate with error

}



myfile1.seekg(0, ios::beg);

size1 = myfile1.tellg();

myfile1.seekg(0, ios::end);

size2 = myfile1.tellg();

filesize = size2 - size1;



count1 = -1;

do

{

count1++;



begin1 = myfile1.tellg();

myfile1.seekg(count1);

if (!myfile1)

{

myfile1.close();

cout << "error in line 51.\n";

system("PAUSE");

exit(1);

}

myfile1.read( reinterpret_cast( &buffer ),1);

x = (int)buffer;



checksum = checksum + x;



} while (count1 != filesize);

return(checksum);

}



// =======================================================================================

int aicheck(double wcksum) // This AI uses the nearest neighbor method with weighted checksums. It is trained on both negative and postive results.

{

double wchecksum;

int result;

int result2;

double small1 = 99999999;

double small2 = 0;

string file1 = "ai.txt";

fstream myfile1;

myfile1.open(file1.c_str());

if (!myfile1)

{

cout << "ERROR LINE 23\n";

system("pause");

exit(1); // terminate with error

}

do

{

myfile1 >> wchecksum >> result;

small2 = abs(wchecksum - wcksum);

if (small2 < small1)

{

small1 = small2;

result2 = result;

}



}while (!myfile1.eof());

return(result2);

}

// =======================================================================================



double weightedchecksum(string file1)

{





// cout << "Getting weighted check sum\n";

double checksum = 0;

int byte1 = 0;

long long count = -1;

long long filesize1 = 0;

long long begin1 = 0;

long long end1 = 0;

unsigned char buffer;

double x1 = .0000001;

double x2 = .0000001;



// open file1

fstream myfile1(file1.c_str(), ios::in
ios::binary);

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

exit(1);

}





// get filesize1

begin1 = myfile1.tellg();

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

exit(1);

}

myfile1.seekg (0, ios::end);

end1 = myfile1.tellg();

filesize1 = (end1-begin1);



count = -1;

do

{

count++;

byte1 = 0;

// read file1

myfile1.seekg(count);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;



checksum = checksum + (byte1 * x1);

x1 = x1 + x2;



} while (count < filesize1 - 1);



myfile1.close();

return checksum;



}



// =======================================================================================



string getstrongchecksum()

{

cout << "Get strong checksum.\n";

fstream myfile1;

string file1 = "delme.txt";

system("md5sum counter.bin > delme.txt");

string schecksum = "";



myfile1.open(file1.c_str(), ios:: in);

if (!myfile1)

{

cout << "122608-12:02 am Unable to open\n";

system("pause");

exit(1); // terminate with error

}



myfile1 >> schecksum;

myfile1.close();

system("rm delme.txt");

return(schecksum);



}



// =======================================================================================



int createcounterfile(string file1)

{





// open file1

fstream myfile1(file1.c_str(), ios::out
ios::binary);

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

exit(1);

}





myfile1.close();

}



// =======================================================================================



int createchecksum(string file1, long long cksum, long long filesize1, int minbyte, int maxbyte)

{

// RANDOMONLY WRITE BYTES USING TIME CLOCK. AND GET CHECKSUM THEN TAKE FILE UP OR DOWN.



cout << "Creating check sum file. This could take a while.\n";

long long count = -1;

int byte = 0;

int byte1 = 255;

long long checksum = 0;

unsigned char buffer;

long long begin1;

MTRand mtrand1;



// open file1

fstream myfile1(file1.c_str(), ios::out
ios::in
ios::binary);

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

exit(1);

}



// loop1 create file with filesize all bytes are 255.

count = -1;

checksum = 0;

do

{

cout << "Building checksum file.\n";

count++;

do

{

byte1 = mtrand1.randInt(maxbyte);

} while(byte1 < 48);

// cout << byte1 << "\n";

checksum = checksum + byte1;



// write file1

buffer = (unsigned char)byte1;

myfile1.seekp(count);

myfile1.write( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellp();



} while (count < filesize1 - 1);





if (checksum > cksum)

{

do

{



count = mtrand1.randInt( filesize1 - 1 );

// // read file1

myfile1.seekg(count);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;

cout << "Bring checksum file DOWN." << " " << checksum << " " << cksum << " " << count << " " << byte1 << "\n";

if (byte1 > 0)

{

checksum = checksum - byte1;

byte1 = byte1 - 1;

checksum = checksum + byte1;

}



// WRITE FILE

buffer = (unsigned char)byte1;

myfile1.seekp(count);

myfile1.write( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellp();



} while(checksum != cksum);

cout << "Done building checksum file.\n";

myfile1.close();

return(0);





}



if (checksum < cksum)

{

do

{



count = mtrand1.randInt( filesize1 - 1 );

// // read file1

myfile1.seekg(count);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;

cout << "Bring checksum file UP." << " " << checksum << " " << cksum << " " << count << " " << byte1 << "\n";



if (byte1 < 255)

{

checksum = checksum - byte1;

byte1 = byte1 + 1;

checksum = checksum + byte1;

}



// WRITE FILE

buffer = (unsigned char)byte1;

myfile1.seekp(count);

myfile1.write( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellp();



} while(checksum != cksum);

}



cout << "Done building checksum file.\n";

myfile1.close();

return(0);

}



// ==============================================================================





long long filesize(string file1)

{

// cout << "Get file size.\n";

long long begin1;

long long end1;

long long filesize1;



// open file1

fstream myfile1(file1.c_str(), ios::in
ios::binary);

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

system("pause");

exit(1);

}



// get filesize1

begin1 = myfile1.tellg();

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

system("pause");

exit(1);

}

myfile1.seekg (0, ios::end);

end1 = myfile1.tellg();

filesize1 = (end1-begin1);

myfile1.close();

// cout.precision(37);

// cout << filesize1 << "\n";

return(filesize1);

}



// ==============================================================================



// write function to compare weighted sums

int compareweightedsums(double wchecksum, double wcksum)

{



cout << "Comparing weighted sums.\n";

long long filesize1;

long long filesize2;

long long count1;

long long begin1;

long long begin2;

long long end1;

long long end2;

int byte1;

int byte2;

unsigned char(buffer);

ofstream c1myfile;

ofstream c2myfile;



c1myfile.open("compare1.txt");

c2myfile.open("compare2.txt");



c1myfile.precision(37);

c1myfile << wchecksum << "\n";

c2myfile.precision(37);

c2myfile << wcksum << "\n";

c1myfile.close();

c2myfile.close();

fstream myfile1("compare1.txt", ios::in
ios::binary);

fstream myfile2("compare2.txt", ios::in
ios::binary);



// get filesize1

begin1 = myfile1.tellg();

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

exit(1);

}

myfile1.seekg (0, ios::end);

end1 = myfile1.tellg();

filesize1 = (end1-begin1);



// get filesize2

begin2 = myfile2.tellg();

if (!myfile2)

{

myfile2.close();

cout << "Failed to read file two.\n";

exit(1);

}

myfile2.seekg (0, ios::end);

end2 = myfile2.tellg();

filesize2 = (end2-begin2);



count1 = -1;

do

{

count1++;

// read file1

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;

// read file2

myfile2.seekg(count1);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte2 = (int)buffer;

if (byte1 != byte2)

{

myfile1.close();

myfile2.close();

system("rm compare1.txt");

system("rm compare2.txt");

return(1);

}



} while(count1 < filesize1 - 1 && count1 < filesize2 - 1);

myfile1.close();

myfile2.close();

system("rm compare1.txt");

system("rm compare2.txt");

return(0);

}



// ==============================================================================



// write functin to compare strong checksum

int comparestrongsums(string schecksum, string scksum)

{



cout << "Comparing strong checksums.\n";

long long filesize1;

long long filesize2;

long long count1;

long long begin1;

long long begin2;

long long end1;

long long end2;

int byte1;

int byte2;

unsigned char(buffer);

ofstream c1myfile;

ofstream c2myfile;

ifstream c3myfile;



system("md5sum counter.bin >> out.txt");

c1myfile.open("compare1.txt");

c2myfile.open("compare2.txt");

c3myfile.open("out.txt");





c3myfile >> schecksum;

c3myfile.close();

system("rm out.txt");



c1myfile << schecksum << "\n";

c2myfile << scksum << "\n";

c1myfile.close();

c2myfile.close();



fstream myfile1("compare1.txt", ios::in
ios::binary);

fstream myfile2("compare2.txt", ios::in
ios::binary);



// get filesize1

begin1 = myfile1.tellg();

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

exit(1);

}

myfile1.seekg (0, ios::end);

end1 = myfile1.tellg();

filesize1 = (end1-begin1);



// get filesize2

begin2 = myfile2.tellg();

if (!myfile2)

{

myfile2.close();

cout << "Failed to read file two.\n";

exit(1);

}

myfile2.seekg (0, ios::end);

end2 = myfile2.tellg();

filesize2 = (end2-begin2);



count1 = -1;

do

{

count1++;

// read file1

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;

// read file2

myfile2.seekg(count1);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte2 = (int)buffer;

if (byte1 != byte2)

{

myfile1.close();

myfile2.close();

system("rm compare1.txt");

system("rm compare2.txt");

return(1);

}



} while(count1 < filesize1 - 1 && count1 < filesize2 - 1);

myfile1.close();

myfile2.close();

system("rm compare1.txt");

system("rm compare2.txt");

return(0);

}



// ==============================================================================



// write function to compare weak checksums

int compareweaksums(long long checksum, long long cksum)

{



cout << "Comparing weak checksums.\n";

long long filesize1;

long long filesize2;

long long count1;

long long begin1;

long long begin2;

long long end1;

long long end2;

int byte1;

int byte2;

unsigned char(buffer);

ofstream c1myfile;

ofstream c2myfile;



c1myfile.open("compare1.txt");

c2myfile.open("compare2.txt");



c1myfile.precision(37);

c1myfile << checksum << "\n";

c2myfile.precision(37);

c2myfile << cksum << "\n";

c1myfile.close();

c2myfile.close();

fstream myfile1("compare1.txt", ios::in
ios::binary);

fstream myfile2("compare2.txt", ios::in
ios::binary);



// get filesize1

begin1 = myfile1.tellg();

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

exit(1);

}

myfile1.seekg (0, ios::end);

end1 = myfile1.tellg();

filesize1 = (end1-begin1);



// get filesize2

begin2 = myfile2.tellg();

if (!myfile2)

{

myfile2.close();

cout << "Failed to read file two.\n";

exit(1);

}

myfile2.seekg (0, ios::end);

end2 = myfile2.tellg();

filesize2 = (end2-begin2);



count1 = -1;

do

{

count1++;

// read file1

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;

// read file2

myfile2.seekg(count1);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte2 = (int)buffer;

if (byte1 != byte2)

{

myfile1.close();

myfile2.close();

system("rm compare1.txt");

system("rm compare2.txt");

return(1);

}



} while(count1 < filesize1 - 1 && count1 < filesize2 - 1);

myfile1.close();

myfile2.close();

system("rm compare1.txt");

system("rm compare2.txt");

return(0);

}



// ==============================================================================









int main (int argc, char *argv[])



{



// declare variables

int runmeforever = 0;

string file1 = "counter.bin";

string file2 = "";

string file3 = ""; // Will hold file name of counters to be written out.

string file4 = ""; // Will be used for lock files.

string filextension = ""; // This will be the file extension of the counter when written out.

long long cksum = 1578; // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< PROGRAM THIS BEFORE HAND!!!!!!!!!!!!!!!!!!!! example setting

long long checksum = 0;

long long filesize1 = 19; // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< PROGRAM THIS BEFORE HAND!!!!!!!!!!!!!!!!!!!! example setting

long long myresults;

double wcksum = 0.001583699999999999734681677132641652861; // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< PROGRAM THIS BEFORE HAND!!!!!!!!!!!!!!!!!!!! example setting

double wchecksum = 0;

string scksum = "fbd1e673de908d272ebdd0c37a0a286e"; // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< PROGRAM THIS BEFORE HAND!!!!!!!!!!!!!!!!!!!! example setting

string schecksum = "";

int runme = 0;

long long countrandom = -1;

long long randomnumber = 0;

long long mychecksum = 0;

long long filesize2 = 0;

long long howmanypositions = 0;

long long startposition = 0;

long long variablename = 0; // this is the name of the written out counter files without the extension.

int test1;

int test2;

int result;

int minbyte = 0;

int maxbyte = 255;

int byte1 = 0;

int byte2 = 0;

int bitnum = 0;

int randefault = 1;

long long maxchecksum = 0;

long long minchecksum = 0;

long long p1;

long long p2;

MTRand mtrand1;

long long passes;

long long count1;

long long count2;

long long begin1;

long long begin2;

long long begin3;

unsigned char buffer;

int bitpos = 0;

int bitposition;



cout << "FIRE CODES" << "\n";



cout << "\n";



cout << "Select your choice." << "\n";



cout << "\n";



cout << "1. Scramble file" << "\n";



cout << "\n";



cout << "2. Train AI" << "\n";



cout << "\n";



cout << "3. Run check-sum counter with AI data mining." << "\n";



cout << "\n";



cout << "4. Run Fire Codes to reconstruct file." << "\n";



cout << "\n";



cout << "5. Create file with specific weak check-sum and byte size." << "\n";



cout << "\n";



cout << "Any other - Exit." << "\n";



cout << "\n";



// get the response



char choice;



cin >> choice;





// process the response



// do something for each valid option



if (choice=='1') {



// ask how many passes

cout << "How many passes?\n";

cin >> passes;



cout << "What is the name of the file you want to scramble?\n";

cin >> file1;



// get size of file

filesize1 = filesize(file1);

// set counts

count1 = -1; // File pointer

count2 = 0; // This counts the passes



// open file

fstream myfile1(file1.c_str(), ios::out
ios::in
ios::binary);

if (!myfile1)

{

myfile1.close();

cout << "Failed to read file one.\n";

system("pause");

exit(1);

}



// start pass loop

cout << "Working ....\n";

do

{

count2++;

count1 = -1;

//start main loop

do

{





count1++;

//get random byte

long long p2 = mtrand1.randInt(filesize1-1);

// swap current byte with random byte

// byte1 = readfile(file1, count1);

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;



// byte2 = readfile(file1, p2);

myfile1.seekg(p2);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte2 = (int)buffer;



// runme = writefile(file1, count1, byte2);

buffer = (unsigned char)byte2;

myfile1.seekp(count1);

myfile1.write( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellp();



// runme = writefile(file1, p2, byte1);

buffer = (unsigned char)byte1;

myfile1.seekp(p2);

myfile1.write( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellp();



// cout << "pass " << count2 << " of " << passes << " " << count1 << " of " << filesize1 - 1 << " " << "swapping position " << count1 << " with position " << p2 << "\n";



// repeat main loop

}while(count1 < filesize1 - 1);

// repeat pass loop

} while(count2 < passes);

myfile1.close();

cout << "Done scrambling file.\n";

system("pause");

exit(0);



} else if (choice=='2') { //



// ask user if these files are for postive or negative result.

cout << "Is this run for a positive or negative result.?\n";

cin >> result;

// ask user name of ai file and tell user this blank file must be created before hand because only appending.

cout << "What is the name of your ai file?\n";

cin >> file3;

// create file list from dir command <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< PUT THIS BACK IN IF RUNNING FOR FIRST TIME OR DO IT MANUALLY. << DEBUG THIS.

// system("dir > filelist.txt");

// cout << "\n";

// cout << "Edit filelist.txt and take out the trash lines if it has any.\n";

// cout << "When done hit enter to continue.\n";

// system("pause");

file1 = "filelist.txt";

fstream myfile1; // filelist

fstream myfile2; // AI file.



myfile1.open(file1.c_str(), ios:: in);

if (!myfile1)

{

cout << "ERROR LINE 447\n";

system("pause");

exit(1); // terminate with error

}



myfile2.open(file3.c_str(), ios:: out); // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< ERROR THIS ERASES THE PREVIOUS FILE SET THIS UP FOR APPEND NOT CREATE.

if (!myfile2)

{

cout << "ERROR IN LINE 455\n";

system("pause");

exit(1); // terminate with error

}

// start mail loop

do

{

myfile1 >> file2;

wchecksum = weightedchecksum(file2);

myfile2.precision(37);

myfile2 << wchecksum << " " << result << "\n";

}while (!myfile1.eof());

myfile1.close();

myfile2.close();

system("pause");

exit(0);



} else if (choice=='3') {



MTRand mtrand1;

// Ask user for length of data file.

cout << "Please enter length of counter files.\n";

cin >> filesize1;



cout << "What weak check-sum are we exploring today?\n";

cin >> cksum;



cout << "What is the extension of the found files. Include the .\n";

cin >> filextension;



cout << "How many results are we looking for.\n";

cin >> myresults;



// Calulate outmany bits needed to calulate this length.

howmanypositions = -1;

count1 = 1;

count2 = 0;

do

{

count2 = count2 + count1;

howmanypositions++;

count1 = count1 * 2;

}while(count2 < filesize1);

count1 = count1 / 2;

startposition = count1; // This will be the highest unit in bits that we can. We start from high and goto low.



// create memory array to hold bits

int bitarray[howmanypositions];



// open devrand and get its file size.

file1="devrand.bin";

filesize2 = filesize(file1);



// open file

fstream myfile1(file1.c_str(), ios::in
ios::binary);

if (!myfile1)

{

myfile1.close();

cout << "Error in line 496.\n";

system("pause");

exit(1);

}



// open counter file.



file2="counter.bin";



// Create the counter file.

runme = createcounterfile(file2);



// open more opening counter file.

fstream myfile2(file2.c_str(), ios::out
ios::in
ios::binary);

if (!myfile2)

{

myfile2.close();

cout << "Error in line 507.\n";

system("pause");

exit(1);

}



// Devrand file position. We can not reset it.

count1 = -1;



// From HERE ARE WE REPEAT THIS OVER AND OVER AGAIN. THIS DOWN HERE IS WHERE THE ACTION IS.

do

{

// copy devrand to counter file.

count2 = -1;

checksum = 0;

do

{

// Setting file position

count1++;

if (count1 == filesize2 - 1)

{

cout << "Device Rand is empty.\n";

myfile1.close();

myfile2.close();

system("del counter.bin");

system("pause");

exit(0);

}



// reading devrand

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;



count2++;

//writting counter file

buffer = (unsigned char)byte1;

myfile2.seekp(count2);

myfile2.write( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellp();



// get weak checksum of counter file



}while(count2 < filesize1 - 1);



// Getting checksum of counter file.

checksum = weakchecksum(file2);

line661:

// read devrand and fill up bit buffer.

do // This is where we use device rand to get a random number nad bring file into check-sum range.

{

count2 = -1; // position in bit buffer;

do

{

// Setting file position

count1++; // DONT RESET THIS.

if (count1 == filesize2 - 1)

{

cout << "Device Rand is empty.\n";

myfile1.close();

myfile2.close();

system("del counter.bin");

system("pause");

exit(0);

}



// reading devrand

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;



bitpos = 128; // REPLACE THIS WITH SHIFTING THE BITS FROM THE BYTES INTO THE BUFFER LATER.

do

{

count2++;

if (byte1 >= bitpos)

{

bitarray[count2] = 1;

byte1 = byte1 - bitpos;

goto line595;

}

if (byte1 < bitpos)

{

bitarray[count2] = 0;

}

line595:

if (bitpos == 0)

{

break;

}



bitpos = bitpos / 2;

if (count2 == howmanypositions)

{

break;

}



} while(byte1 != 0);

if (count2 == howmanypositions)

{

break;

}



} while(count2 < howmanypositions);



count2 = -1;

randomnumber = 0;

bitposition = startposition;

do // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< This loop has to be checked real hard but logic here will work.

{

count2++;

bitnum = bitarray[count2];

if (bitnum == 1)

{

randomnumber = randomnumber + bitposition;

}

if (randomnumber > filesize1 - 1)

{

randomnumber = randomnumber - bitposition;

break;

}

bitposition = bitposition / 2;



}while(count2 < howmanypositions);



if (randomnumber > filesize1 - 1)

{

randomnumber = mtrand1.randInt(filesize1 - 1);

}



// using file position take counter file down in size or counter file up in size.

if (cksum > checksum)

{

// read byte at random position from file

myfile2.seekg(randomnumber);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte1 = (int)buffer;



// if can add to byte

if (byte1 < 255)

{

checksum = checksum - byte1;

byte1 = byte1 + 1;

checksum = checksum + byte1;

}



//writting counter file

buffer = (unsigned char)byte1;

myfile2.seekp(randomnumber);

myfile2.write( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellp();

// write byte back to file.

}



if (cksum < checksum)

{

// read byte at random position from file

myfile2.seekg(randomnumber);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte1 = (int)buffer;



// if can subtract from byte

if (byte1 > 0)

{

checksum = checksum - byte1;

byte1 = byte1 - 1;

checksum = checksum + byte1;

}



//writting counter file

buffer = (unsigned char)byte1;

myfile2.seekp(randomnumber);

myfile2.write( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellp();

// write byte back to file.



}



// checksum = weakchecksum(file2); // This slows the program too much only use for testing.



// repeat till counter file created

}while(cksum < checksum

cksum > checksum);



// Put in test loop for check sum

checksum = weakchecksum(file2);

if (checksum < cksum

checksum > cksum)

{

goto line661;

}

// get weighted sum of counter file.

wcksum = weightedchecksum(file2);



// compare weighted sum to ai file. If result found copy it out to found files. create function for this. //

test1 = aicheck(wcksum);



// If AI logic comes back true copy counter file to output file. Will need SS string for this.

// WRITE CODE HERE TO COPY COUNTER FILE OUT TO WITH EXTENSIONS.

if (test1 == 1)

{

variablename++;

std::stringstream ss;

ss << variablename;

ss >> file3;

file3 = file3 + filextension;



// open file1

fstream myfile3(file3.c_str(), ios::out
ios::binary);

if (!myfile1)

{

myfile3.close();

cout << "Failed to read file three.\n";

system("pause");

exit(1);

}



count2 = -1;

do

{

count2++;

myfile2.seekg(count2);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte1 = (int)buffer;



buffer = (unsigned char)byte1;

myfile3.seekp(count2);

myfile3.write( reinterpret_cast( &buffer ),1);

begin3 = myfile3.tellp();



}while (count2 < filesize1 - 1);

myfile3.close();

}



// PUT REPEAT COMMAND HERE. WE MADE A NOTE AT THE TOP FOR THIS.

}while(variablename < myresults);// Bull shit to make this run forever. Let error up above catch device rand empty to end this. Or put in lock file later.

cout << "The program has finished.\n";

system("pause");

exit(0); // Just in case we get this far shut this program down. yeah, leave this in or choice 3 can bleed in to choice 4.





} else if (choice=='4') {



MTRand mtrand1;

// Ask user for length of data file.

cout << "Please enter length of counter files.\n";

cin >> filesize1;



cout << "What weak check-sum are we exploring today?\n";

cin >> cksum;



cout << "What is the extension of the found files. Include the .\n";

cin >> filextension;



cout << "How many results are we looking for.\n";

cin >> myresults;



cout << "Please carefully enter the weighted check-sum you are looking for.\n";

cin >> wchecksum;



// Calulate outmany bits needed to calulate this length.

howmanypositions = -1;

count1 = 1;

count2 = 0;

do

{

count2 = count2 + count1;

howmanypositions++;

count1 = count1 * 2;

}while(count2 < filesize1);

count1 = count1 / 2;

startposition = count1; // This will be the highest unit in bits that we can. We start from high and goto low.



// create memory array to hold bits

int bitarray[howmanypositions];



// open devrand and get its file size.

file1="devrand.bin";

filesize2 = filesize(file1);



// open file

fstream myfile1(file1.c_str(), ios::in
ios::binary);

if (!myfile1)

{

myfile1.close();

cout << "Error in line 496.\n";

system("pause");

exit(1);

}



// open counter file.



file2="counter.bin";



// Create the counter file.

runme = createcounterfile(file2);



// open more opening counter file.

fstream myfile2(file2.c_str(), ios::out
ios::in
ios::binary);

if (!myfile2)

{

myfile2.close();

cout << "Error in line 507.\n";

system("pause");

exit(1);

}



// Devrand file position. We can not reset it.

count1 = -1;



// From HERE ARE WE REPEAT THIS OVER AND OVER AGAIN. THIS DOWN HERE IS WHERE THE ACTION IS.

do

{

// copy devrand to counter file.

count2 = -1;

checksum = 0;

do

{

// Setting file position

count1++;

if (count1 == filesize2 - 1)

{

cout << "Device Rand is empty.\n";

myfile1.close();

myfile2.close();

system("del counter.bin");

system("pause");

exit(0);

}



// reading devrand

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;



count2++;

//writting counter file

buffer = (unsigned char)byte1;

myfile2.seekp(count2);

myfile2.write( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellp();



// get weak checksum of counter file



}while(count2 < filesize1 - 1);



// Getting checksum of counter file.

checksum = weakchecksum(file2);

line1242:

// read devrand and fill up bit buffer.

do // This is where we use device rand to get a random number nad bring file into check-sum range.

{

count2 = -1; // position in bit buffer;

do

{

// Setting file position

count1++; // DONT RESET THIS.

if (count1 == filesize2 - 1)

{

cout << "Device Rand is empty.\n";

myfile1.close();

myfile2.close();

system("del counter.bin");

system("pause");

exit(0);

}



// reading devrand

myfile1.seekg(count1);

myfile1.read( reinterpret_cast( &buffer ),1);

begin1 = myfile1.tellg();

byte1 = (int)buffer;



bitpos = 128; // REPLACE THIS WITH SHIFTING THE BITS FROM THE BYTES INTO THE BUFFER LATER.

do

{

count2++;

if (byte1 >= bitpos)

{

bitarray[count2] = 1;

byte1 = byte1 - bitpos;

goto line1281;

}

if (byte1 < bitpos)

{

bitarray[count2] = 0;

}

line1281:

if (bitpos == 0)

{

break;

}



bitpos = bitpos / 2;

if (count2 == howmanypositions)

{

break;

}



} while(byte1 != 0);

if (count2 == howmanypositions)

{

break;

}



} while(count2 < howmanypositions);



count2 = -1;

randomnumber = 0;

bitposition = startposition;

do // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< This loop has to be checked real hard but logic here will work.

{

count2++;

bitnum = bitarray[count2];

if (bitnum == 1)

{

randomnumber = randomnumber + bitposition;

}

if (randomnumber > filesize1 - 1)

{

randomnumber = randomnumber - bitposition;

break;

}

bitposition = bitposition / 2;



}while(count2 < howmanypositions);



if (randomnumber > filesize1 - 1)

{

randomnumber = mtrand1.randInt(filesize1 - 1);

}



// using file position take counter file down in size or counter file up in size. /////////////// <<<<<<<<<<<<<<<<<<<<<<<< update checksum.

if (cksum > checksum)

{

// read byte at random position from file

myfile2.seekg(randomnumber);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte1 = (int)buffer;



// if can add to byte

if (byte1 < 255)

{

checksum = checksum - byte1;

byte1 = byte1 + 1;

checksum = checksum + byte1;

}



//writting counter file

buffer = (unsigned char)byte1;

myfile2.seekp(randomnumber);

myfile2.write( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellp();

// write byte back to file.

}



if (cksum < checksum)

{

// read byte at random position from file

myfile2.seekg(randomnumber);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte1 = (int)buffer;



// if can subtract from byte

if (byte1 > 0)

{

checksum = checksum - byte1;

byte1 = byte1 - 1;

checksum = checksum + byte1;

}



//writting counter file

buffer = (unsigned char)byte1;

myfile2.seekp(randomnumber);

myfile2.write( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellp();

// write byte back to file.



}



// checksum = weakchecksum(file2); // This slows the program too much only use for testing.



// repeat till counter file created

}while(cksum < checksum

cksum > checksum);



// Put in test loop for check sum

checksum = weakchecksum(file2);

if (checksum < cksum

checksum > cksum)

{

goto line1242;

}

// get weighted sum of counter file.

wcksum = weightedchecksum(file2);



// compare weighted sum to ai file. If result found copy it out to found files. create function for this. //

test1 = compareweightedsums(wchecksum, wcksum);



// WRITE CODE HERE TO COPY COUNTER FILE OUT TO WITH EXTENSIONS.

if (test1 == 0)

{

variablename++;

std::stringstream ss;

ss << variablename;

ss >> file3;

file3 = file3 + filextension;



// open file1

fstream myfile3(file3.c_str(), ios::out
ios::binary);

if (!myfile1)

{

myfile3.close();

cout << "Failed to read file three.\n";

system("pause");

exit(1);

}



count2 = -1;

do

{

count2++;

myfile2.seekg(count2);

myfile2.read( reinterpret_cast( &buffer ),1);

begin2 = myfile2.tellg();

byte1 = (int)buffer;



buffer = (unsigned char)byte1;

myfile3.seekp(count2);

myfile3.write( reinterpret_cast( &buffer ),1);

begin3 = myfile3.tellp();



}while (count2 < filesize1 - 1);

myfile3.close();

}



// PUT REPEAT COMMAND HERE. WE MADE A NOTE AT THE TOP FOR THIS.

}while(variablename < myresults);// Bull shit to make this run forever. Let error up above catch device rand empty to end this. Or put in lock file later.

cout << "The program has finished.\n";

system("pause");

exit(0); // Just in case we get this far shut this program down. yeah, leave this in or choice 3 can bleed in to choice 4.



} else if (choice=='5') {



minbyte = 0;

maxbyte = 255;

cout << "Enter name of file.\n";

cin >> file1;

cout << "You entered " << file1 << "\n";

cout << "Enter weak check-sum.\n";

cin >> cksum;

cout << "You entered " << cksum << "\n";

cout << "Enter file size.\n";

cin >> filesize1;

cout << "You entered " << filesize1 << "\n";

runme = createcounterfile(file1);

runme = createchecksum(file1, cksum, filesize1, minbyte, maxbyte);

cout << "FILE CREATED.\n";

system("pause");

exit(0);



} else {



// if we got this far, the response was not valid



cout << "Good bye." << "\n";

system("pause");

exit(0);



}





}