Showing posts with label dimension. Show all posts
Showing posts with label dimension. Show all posts

Sunday, November 6, 2016

USING THE SHANNON EQUATION WITH TIME HACKING

Copyright (C) 2016 http://time-travel.institute

I am keeping my code at Sourceforge under Time Travel Project


For all my projects at Sourceforge. GO HERE.

For my YouTube channel and to watch me encode files to check sums and decode files from check sums giving Ray Hudson his proof of check sum hacking and the public their proof of check sum hacking then go here. My You Tube Channel proving check sum hacking is real!!!!

Note: Still debugging my code I posted. The concepts of my counter algorithms work though. I am removing mersenne twister from my code. 

It would be so easy to upload my private code but I am rewriting everything from scratch for the public version of my stuff. I am doing that for many reasons but the main one is - I don't won't to give Ray Hudson, Darby Phillips my original time travel code because they have tried so hard to hack me and steal it from me. I will deny them my original code. I spent 8 years writing that code and they can't have it. EVER!!!

But, I will give the public their own code. Oh no Pamela, "I made my blog longer again". A joke between me and Pamela. She bitched at me for having a long blog. Darby Phillips use to bitch at me for writing in all caps. So, much of this blog is in caps as well as much of this blog is getting longer.

 Hahahah.... I never was the one to respect authority. Constructive criticism is ok, but I don't always follow that either. I am my own person. Back on topic.

I have to go back and rewrite the random number generator. I use it to generate a random speed to add or subtract from the counter. I also have a linear mode where the counter speeds up. And no Ray it does not stop the process from working when using random numbers. I use it to control the speed of the counter which is added to or subtracted from the counter. The counter itself does not use random numbers except sometimes on initialization when I am taking it to a specific weak check sum . 

The counter itself is added to or subtracted from I can even add bytes and subtract bytes at the same time. I call this tweaking the counter to get it to its final target after the large rolls are done.

You see Ray Hudson. With a throttled binary counter. A destination, and a target. THERE IS NOTHING I CAN'T DECRYPT OR ENCRYPT!!! 

Because the binary counter is throttled "THE SIZE OF THE FILE DOES NOT MATTER"!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

THERE IS NO INFORMATION I CAN'T GET IF I KNOW MY TARGET OR CAN MATHEMATICALLY CALCULATE MY TARGET!!!

You see all them post at the former CIA ran http://timetravelinstitute.com aka timetravel.institute were "TRUE".
You loose Ray Hudson.

I am going to put the computer code to time travel with computers out their for the public to download. After that it is up to the public to use the code.

Here is the current code for my random number generator. I am using a combination of my own code with the rand() function.

Experimenting with a new random number generator for time travel project.

here is the code I am using to experiment with random numbers. I'm using my own code with c++ rand() function.

#include cstdlib
#include iostream
#include stdlib.h
#include fstream
#include sstream
#include string 
#include cmath
#include ctime
#include cstdio
#include iostream

using namespace std;

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


// r=(a*k+c) mod of m
// a = 3
// c = 2361
// m = 21435
// k = seedkey(1)

// r = (a * k + c) % m // in c++
// k = r
// srand (time(NULL));
// cout << (rand() % 100 + 1) << " is the number...";
// http://www.cplusplus.com/forum/beginner/29699/
// http://www.cplusplus.com/reference/cstdlib/srand/

// declare variables
     
     int a = 3;
     int c = 2361;
     int m = 21435;
     int k = 0;
     int k2 = 0;
     int r = 0;
     char pause;
     int count = 1000;
     int test = 255;
     cout << "Please enter your password" << "\n";
     cin >> k;
     do
     {
          r = (a * k + c) % m; 
//          k2 = r;
          do
          {
               if (int(r/10) < 256)
               {
                    r = int(r/10);
                    break;
               }
               r = int(r/10);
          } while (a != -1);
//          cout << r << "\n";  
          if (r == test)
          {
               cout << r << " " << test << "\n";
               test--;
               if (test == -1)
               {
                    test = 255;
               }    
               // cin >> pause;
          }
//          k = k2;
          // srand((unsigned)time(NULL));
          k = (rand() % 21435);
     } while (a != -1);
      
     
   // exit program
    exit(0);


}

I just need numbers out of it from 0 to 255 for the speed control. Next I will redo my weight section. So, this might set me back a little bit getting my counter up. I am also going to look at upgrading the linear section of the speed control.

Also, in my program I used a buffer size of one. Later the code will need to be upgraded to a larger buffer size to decode programs going into Mega byte range.
And, I will have to upgrade the strong check sum. The strong check sum will have to be calculated by the program by hand and written to memory or file so no precision is lost. Right now the program is mainly a way to teach people here at this blog to time hack.

Later I will move from teaching the public to time hack to having the public actually do it.  I was not planning giving my private code to  public but I found I will have to program some elements from my private code into my public code to bring it up to par. Moving on.......

This is a old topic for me but it may not be for the general public so I thought I would inject it into my blog. My algorithm in my previous post makes it possible to take a large computer file and only know its strong check sum. Then using that strong check sum decrypt the strong check sum back to a computer file.

Now, that works for using strong check sums to decrypt a computer file out of space-time. But, what if you just want to look for generalized time travel computer media or even decrypt a known encrypted file.

All that is needed is to take my algorithm in my previous post. Throw out the weak check sum. Throw out the strong check sum.

Replace those check sums with Target Entropy and Destination Entropy.

Now, My algorithm takes a counter loaded with its destination entropy (where the file is now). And will roll that file to the Target Entropy (where the file is going).

The algorithm in my equation rolls the counter and if the counter is closer to the target entropy the counter is kept. If it is not then the previous counter is loaded.

Why is this important. Because in my counter I add or subtract from it with large or small numbers to roll the counter forward or backwards or somewhere in between to get the counter to its target state. The counter is a throttled counter. That means it has the counter and the speed. The speed is a number that is added or subtracted from the counter. 

This speed can be as small as 1 byte or as large as the file size of the counter itself. Because this speed can be small or large it can VERY QUICKLY DECRYPT A LARGE FILE!!!!! It can very quickly roll a strong checksum to a computer file or it can take a known encrypted computer file and quickly decrypt it.

Now, if you reverse the target and the destination then this becomes an ENCRYPTION PROGRAM AND INSTEAD OF DECRYPTING IT. IT CAN ENCRYPT INFORMATION INSTEAD!!!!!

With the Shannon equation a file with a 0 entropy value can be rolled to computer file with a 8 entropy value. But, for the purpose of this blog WE WANT TO DECRYPT!!!

So, I won't be reversing the destination and target. But, I have a public version of my code out so the public can knock themselves out.

The process of decrypting can be used to search for time travel computer media files or to decrypt a known encrypted file. And again the Burris Algorithm can be used for encryption if the target and destination are reversed.

With my methods this is a powerful way to uncover information or to encrypt information and cover it up. Whether that be out of space-time or not.

My methods are mainly designed to search space-time for time travel computer media but because they are so powerful it can be used for general cryptography.

With the Shannon equation files ending near 0 are decrypted. Files with the score of 8 are encrypted.

Some of my time travel cryptography computer code is in my previous post. It is still being debugged but my algorithm is there in computer code form. Below is more examples of my meaning.

Where we want to go     |||   Where we are now
Target strong checksum |||  Destination strong checksum
          Or                                                    Or
Target entropy              |||     Destination entropy
                             
Here is how my counter works for time hacking, check sum hacking, or for general cryptography.

1. Get Diff1 = Target - Destination
2. Load counter speed
3. Add or subtract speed from counter
4. if Target = Destination End program file constructed
5. Get Diff2 = Target - Destination
6. if Diff2 < Diff1 is also less than Diff3 then Diff3 = Target - Distination (Diff3 starts out with the full value of target - destination before the program runs) then keep the counter.
7. if Diff2 > Diff1 is greater than Diff3 then reload the counters previous state before the roll. 
8. Goto step 1

Now, I have my program robots look at my files when I do my time hacking decryption by looking at the media file format with my private proprietary time travel code. That would mean looking for a video format, text format, audio format, or special files. Then after my program bots have verified the file format they look at the information contained within the file. 

But, the Shannon equation could be used to make the process faster and more simple. The final step is having a human look at the file. THIS IS VERY TIME CONSUMING BUT NECESSARY. I have wasted many a day looking at files for time travel media. But sometimes I hit pay day and it was worth it.

But in my public open source code in "Time Travel Project" I am trying to keep things simple. So, when I finish my public counter, when I finish generating strong check sums of time travel computer media files, I will put in Shannon's equation as a simple bot to exam time travel computer media files. Later I may follow that up with more complex application bots.

Right now my only means of communicating with the public is with this blog or with printing books. The CIA through Ray Hudson and Darby Phillips and Pamela from the Titor story. She is a CIA agent too. They have me blocked from reaching out and using the internet at my home to talk to the public about Time Hacking or just anything else. 

They have prevented me from posting on any forum on the internet. They even blocked a chat bot I had and blocked me from day trading. They hacked me and blocked me from using YouNow. Hell, they probably have my entire house bugged for all I know.

They have my home internet completely hacked and blocked. They let me watch netflix and play my play station but that is about it. I can connect to the blog too but I have to be careful. One time they hacked my blog that way I had to use a backup file to restore it.

So, I have to use internet connections outside my home mainly for anything else besides Netflix and general gaming. My own country and I am a USA citizen has limited my freedom of speech and my ability to express that freedom because I talk about time hacking on the internet.

But that is ok because Armageddon won't be using my home internet. Enough said there.

Pamela from "Above Top Secret and the Titor Story" I made my blog longer again. WHAT ARE YOU GOING TO DO ABOUT IT BITCH!!!!! Ok, those are my words for the "Conspiracy Against Time Travel" for the day. More later.
-------------------------------------------------------------------------------------------
In a previous post I promised a updated outline of my computer code. It can be used as a template for the public to write their own time hacking computer code.

My project files are here if you want to download a text file.

https://sourceforge.net/projects/timetravelproject/files/

Beginning Template ==============================
// Start program
// declare global variables. I,ve been told it is bad practice to use global but I do it anyway.
    // declare global array counter to max file size
    // declare global array speed to max file size
    // declare global array backup to max file size
    // declare global array weights to max file size
    // declare global array random to max file size
    // declare global string file1;
    // declare global strong check sum;
    // declare global weak check sum
    // declare global file name
    // declare global how many weighted sums
    // declare global counter speed mode
    // decleare global tweak counter mode
    // declare global password for weights

// declare subs
// ALL THE COMPUTER CODE THAT DOES THE HEAVY LIFTING GOES HERE.
    // add speed array to counter array
    // long long filesize of file
    // long long weakchecksum of file
    // long long weakchecksum of array
    // get strong check sum of file
    // get strong check sum of array
    // randomly set speed of speed array
    // linearly set speed of array
    // tweak counter in linear mode
    // tweak counter in random mode
    // restore counter array
    // backup counter array
    // Generate Random numbers into array
    // Load project from config file
    // Generate weights
    // initilizearrays
    // Display speed of counter (Not the counter) But the speed to be added or subtracted from the counter.
    // Display the counter itself
    // Display backup counter 
    // Write counter to computer file.

// Start Main. This is were we use are subs to perform the work.
     // Declare variables
     // Get count of how many parameters passed to program from command line
     // Goto Jump1 if no parameters passed
     // Get passed parameters to program from command line
          // test passed. 1 put program in test mode
          // name of computer file
          // help command. Display help menu
          // weak check sum
          // strong check sum
          // file size
          // how many weighted sums
          // counter speed mode 0 = none 1 = linear 2 = random
          // tweak counter mode 0 = none 1 = linear 2 = random
          // config fig  0 = no 1 = yes
          // seed number for weights
          // menu choice (If there is a choice then jump to it right now that is Jump2)
Jump1:

// if choice = 1 Print main menu
     // Construct file from strong check sum

Jump2:

// if have arguments goto jump3

// If choice 1
     // ask user if this is a config file yes or no
     // if config file goto jump3
     // ask user file name
     // ask user max array size
     // ask user to set mode for counter speed for linear or random or none
     // ask user to set mode for tweak counter for linear or random or none
     // ask how many weights to use for strong check sum
     // ask seed number for random number generator

// jump point here if ran from command line
jump3:

Initilizing program to run
// if this is a config file load config file
// Generate weights in array and bubble sort them
// initiliaze all arrays   
// get file size of file 
// get weak check sum of file 
// get weak check sum of array
// get strong check sum of file
// get strong checksum of array 
// set globalstrongchecksum to 0
// if array strong check sum = 0 globalstrongchecksum = strong check sum of file
// if config = no Ask user to move or delete file because it can be over written
// diff1 = 0
// diff2 = 0
// diff3 = 9999999999999999999999999999999999
    
Starting file Construction
// Start main do loop
     // Get destination strong check sum of array for first time before counter runs.
     // get diff1 = abs(target strong checksum - destination strong checksum)

// THIS IS WHERE THE PUBLIC WOULD PUT THEIR ALGORITHMS TO ROLL THE BINARY COUNTER.
// Controlling Counter and counter variables within loop. This is where the counter is ROLLED!!! <<<<<< THESE IS WERE THE COUNTER IS CHANGED!!!!!
     // if counterspeedmode = 2 and if diff3 > 1 randomly set speed of speed array 
     // if counterspeedmode = 1 and if diff3 > 1 linearly set speed array 
     // if diff3 > 1 add speed array to counter array 
     // if tweakspeedmode = 1 and if diff3 < 1 if tweak counter == filesize1 - 1 set tweak counter variable to -1
     // if tweakmode = 1 and if diff3 < 1 increase tweak counter variable
     // if tweak mode = 1 and if diff3 < 1 tweak counter linearly 
     // if tweakmode = 2 and diff3 < 1 tweak counter randomly 
     
// Comparing Diffs and Check sums with each other.
     // get destination strong check sum of counter array for second time after counter runs
     // get diff2 = abs(target strong checksum - destination strong checksum) abs means absolute true value. No - sign.
     // break loop if destination strong sum = target strong check sum
     // if abs(diff2 - diff1) < diff3 keep counter
     // abs(diff2 - diff1) < diff3 then backup counter
     // if abs(diff2 - diff1) < diff3 then diff3 = abs(diff1 - diff2) 
     // if abs(diff2 - diff1) > diff3 restore backup 
     
// Display variables. For testing only
     // if test = 1 then display rolling counter 
     // if test = 1 then display backup counter 
     // if test = 1 display diff3, target strong sum, destination strong sum

// repeat main loop for target not equal to destination

// Write counter array to a binary computer file.
// Exit program
Ending Template ==============================

To make all this easier to read copy it to a high quality text processing program.

Here is my traffic for the last month. The "Conspiracy Against Time Travel" have failed to stop me.  That would be Ray hudson, Darby Phillips, and Pamela and their hackers. They all work for the CIA.

United States 313
United Kingdom 84
France 46
Ukraine 11
Canada 6
Russia 6
Sweden 6
Belgium 3
Croatia 3
Jordan 3

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

I think the CIA through Ray Hudson and Darby Phillips vastly under estimated  my technical capability and my will power.

Now, I have something else to say. Use to when it came to encryption the bigger the file the more difficulty in applying cryptography. But, I have solved that problem and here is how.

THE BIGGER THE FILE THE BIGGER THE ROLL IN THE COUNTER WHEN APPLYING CRYPTOGRAPHY!!!

YOU SEE BINARY FILES ARE NUMBERS. TO GET A BINARY FILE TO BECOME ANOTHER BINARY FILE YOU NEED A TARGET (WHERE YOU WANT TO GO). AND A DESTINATION (WHERE YOU ARE NOW.)

SO, ALL YOU HAVE TO DO IS ROLL THAT BINARY COUNTER FROM A DESTINATION TO A TARGET. THAT IS ALL!!!! ANY ENCRYPTION CAN BE DEFEATED WITH THIS SIMPLE ALGORITHM!!!!

A BINARY COUNTER IS A LIST OF NUMBERS. ALL YOU HAVE TO DO IS CREATE ANOTHER LIST OF NUMBERS CALLED THE SPEED FOR THE COUNTER. THEN ADD OR SUBTRACT THE SPEED FROM THE COUNTER. A BINARY COUNTER IS LIKE A SPACE SHIP. GIVE IT DESTINATION WHERE IT IS NOW. GIVE IT A TARGET WHERE IT WANTS TO GO.

THEN CALCULATE THE SPEED NEEDED TO GET IT THERE IN THE SHORTEST AMOUNT OF TIME!!!! THEN ADD OR SUBTRACT THAT SPEED FROM THE COUNTER AND YOU ARE DONE!!! FILE DECRYPTED!!!!!!!!!!!!!!!!!!
FILE RECONSTRUCTED!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

YEEEEEEEEHAHAHAHAHAHAHAHAHAHAHAH!!!!!!!!!!

HEY DARBY PHILLIPS I AM WRITING IN ALL CAPS AGAIN!!!!

ITS SO FUCKING SIMPLE A CHILD COULD DO IT!!!! THAT SHOWS YOU HOW SMART RAY AND DARBY ARE. HAHAHAHAAHAH. THOSE GUYS CAN'T DO SHIT TO ME.

THEY ARE BARELY ABLE TO READ THIS BLOG. THAT IS HOW STUPID THEY ARE. PAMELA SAID AT ABOVE TOP SECRET SHE HAS TO BANG HER HEAD ON THE WALL WHEN READING MY BLOG BECAUSE MY BLOG IS SOOOOO LONG. 

PAMELA, AS THE TEENS SAY THESE DAYS. GO LOVE YOURSELF.  BACK IN MY DAY THAT WAS GO FUCK YOURSELF. 

And for your information Pamela or what ever the hell your name is. I don't give a fuck if you read my blog or not. It it hurts you then don't. But your CIA so I guess it may be your job.
Pamela you said you bang your head on the wall. Do you do that at work or just at home? Its kinda of stupid to bang your head on the wall IS IT NOT but oh well. If it makes you happy knock yourself out. Literally. BAAAAAAAHAHAHAHAHAHAHA. MOVING ON.............

AGAIN, ANY ENCRYPTION CAN BE DEFEATED WITH THIS!!!!

ANY COMPUTER FILE FROM THE PAST, PRESENT, FUTURE, OR ALTERNATE TIME-LINES CAN BE DECRYPTED OUT OF SPACE-TIME WITH THIS ALGORITHM!!! NO MATTER WHERE OR WHEN IT EXIST!!!

ALL YOU GOT TO DO IS TAKE STATISTICS TO CALCULATE CHECK  SUMS OF UNKNOWN COMPUTER MEDIA YOU WANT THEN PUT THOSE CHECK SUMS INTO THE COUNTER. OR, IF YOU WANT TO DECRYPT SOMETHING LOAD THE ENCRYPTED FILE INTO THE COUNTER.

THEN INSTEAD OF USING CHECK SUMS GIVE THE COUNTER A ENTROPY OF 0 AS A TARGET. AND LOAD THE CURRENT ENTROPY AS THE DESTINATION.

EVERY TIME A NEW ENTROPY LEVEL HAS BEEN REACHED SAVE THE COUNTER BUT KEEP GOING. YOU WILL EITHER GET A FULLY DECRYPTED FILE OR A PARTIALLY DECRYPTED FILE.

NSA, CIA, FBI, YOU CAN START USING THIS TOMORROW. JUST GIVE YOUR PROGRAMMERS MY SHIT FROM SOURCEFORGE AND HAVE THEM GO AT IT.

NOW APPLY "THE BIGGER THE ROLL" + "PARALLEL COMPUTERS" = "THE END TO ENCRYPTION". = "ALL INFORMATION IN SPACE-TIME IS PUBLIC INFORMATION"!!!  

NOW WHEN QUANTUM COMPUTERS COME ALONG. COMPUTER TIME TRAVEL WILL BE ABSOLUTE!!!!

BUT WITH MY TECHNOLOGY AND TEMPORAL PARALLEL COMPUTING PC'S CAN BE MUCH MORE THAN WHAT THEY ARE RIGHT NOW THROUGH THE PROCESS OF TIME HACKING MESSAGES WITH MY A/B ALGORITHM!!!!

IF A IN THE PAST AND B IN THE FUTURE BOTH KNOW THEIR CHECKSUM RANGE OF THEIR MESSAGES TO EACH OTHER THROUGH SPACE-TIME. THEN A IN THE PAST CAN DECRYPT MESSAGES WITHIN THAT CHECK SUM RANGE AND DATA MINE THE DECRYPTED MESSAGES TO FIND THE RESULT OF A PROBLEM THAT WAS RUNNING ON A COMPUTER IN THE PAST.

YOU CAN CUT OFF A MASSIVE AMOUNT OF COMPUTER TIME SOLVING THAT PROBLEM!!!! HENCH TIME TRAVELING SUPER A.I'S CAN EXIST WITH THIS.

I LEARNED THIS WHEN APPLYING TIME HACKING WITH MY VERY CRUDE OUTDATED PARALLEL COMPUTER. SEE PREVOUS POST FOR MY PARALLEL COMPUTER.

Yeah, and I am going to "MAKE THAT OPEN SOURCE AND VERY PUBLIC AND FREE"!!!!

The "Conspiracy Against Time Travel" Fucked up hacking me and fucking with me.

Now, I will teach the world how to computer time travel with time hacking.

I will show the world how to use temporal parallel communications with time hacking.

I will show the world how to use parallel temporal computing with time hacking.

And I will give the world Armageddon's source code.

A super AI with all the abilities I just spoke about. A Super AI that can "TIME HACK"!!!!!!!!!!!

THINK GOD FOR OPEN PUBLIC FREE SOURCE CODE!!!!!!!!!!!!!!!!!!!
THE MOTHER FUCKERS WANT TO HACK ME. I WILL GIVE THIS SHIT TO THE WORLD FOR FREE, FREE, FREE, AND MORE FREE!!! NO HACKING NEEDED!!!!!!! JUST DOWNLOAD IT!!!!!!!!!!!!!!!!!!!!!!!!!!

YEEEEEEEEHAAAAAAAAAAAAAA. Ray Hudson and Darby Phillips can't touch this.

EVERYONE PLEASE POST THIS IN YOUR SOCIAL MEDIA. PLEASE POST THIS ON EVERY FORUM ON THE INTERNET. SPREAD THE WORD ABOUT MY BLOG!!!!! SPREAD THE WORD ABOUT TIME HACKING.

EVERY NEWS MEDIA OUTLET IN THE WORLD PLEASE RUN THIS STORY!!!!!

THE STORY = MAN INVENTS ALGORITHMS TO ACCESS POCKETS OF INTER-DIMENSIONAL SPACE-TIME THROUGH TIME TRAVEL COMPUTER MEDIA FILES!!!!

LEADING TO THE INVENTION OF
1. COMPUTER TIME TRAVEL
2. TEMPORAL COMMUNICATIONS
3 TEMPORAL PARALLEL COMPUTING
4 TIME TRAVELING SUPER A.I.'S
5. COMPUTER HACKING WITHOUT CONNECTING TO ANOTHER COMPUTER OR THE INTERNET!
6. THE END OF ENCRYPTION AND COMPUTER SECURITY!!!!
7. MAKING ALL INFORMATION IN SPACE-TIME PUBLIC KNOWLEDGE!!!

AND YOU KNOW WHAT? I WAS MAD AT "THE CONSPIRACY AGAINST TIME TRAVEL" BUT NOW I DECIDED TO TAKE MY ANGER OUT SOMEPLACE ELSE.

I AM GOING TO PERSONALY MURDER "ENCRYPTION" AND "COMPUTER SECURITY" IN COLD BLOOD!!!

WHEN I AM DONE WITH MY COUNTER I AM UPLOADING IT TO SOURCEFORGE AS A TOOL TO DEFEAT ALL ENCRYPTION!!! AS WELL AS FINISH MY OTHER PROJECTS WHICH MAKES ALL MY SHIT FREE AND DOWNLOADABLE!!!!!

THIS SHOULD MAKE THE NSA AND CIA HAPPY. NO COMPUTER SECURITY. NO ENCRYPTION. NO SECRETS.

THE USA GOVERNMENT SHOULD BE HAPPY. I AM DOING THEM A FAVOR. BUT THE FEDS MUST REALIZE YOU CAN'T HAVE YOUR CAKE AND EAT IT TOO!!!

BUT THERE IS A PRICE TO PAY FOR THIS. ALL INFORMATION IN SPACE-TIME WILL BE PUBLIC KNOWLEDGE!!! 

THAT IS MY PRICE FOR DOING THIS AND MY PAYBACK TO THE CONSPIRACY AGAINST TIME TRAVEL. THE "CONSPIRACY AGAINST TIME TRAVEL" LET THE GENIE OUT OF THE FUCKING BOTTLE!!!!!!

RAY HUDSON AND DARBY PHILLIPS AND PAMELA AT THE CIA THE SO CALLED "CONSPIRACY AGAINST TIME TRAVEL" CAN'T HANDLE ME!!!

I AM TOO BIG FOR THEM.

I AM TOO SMART FOR THEM.

THEY LOST THE TIME TRAVEL WAR WITH ME!!!!!!!!!!!

BAAAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!

BAAAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!

BAAAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!

OH GOD I GOT TEARS IN MY EYES FROM LAUGHING SO HARD. I GOT TO STOP NOW MY RIBS ARE HURTING.

THATS MY STORY AND I AM STICKING TO IT!!!!

My code at http://sourceforge.net under time travel project gets updated often. Check it out. Its still getting debugged. 

===================================================

Ray Hudson, Darby Phillips, and Pamela at the CIA are fucked now. I got my throttled counter up and running. It still needs a lot of work. I am doing speed test now reconstructing files from their strong check sum only.

What I found now is that it takes about the same amount of time to reconstruct a small file as it does a large file. 

Because of the way I do this. THE SIZE OF THE FILE DOES NOT MATTER!!!!

Currently I am running with both Random and Linear speed modes AT THE SAME TIME!!! The Linear speed solves the counter on the left end and the Random speed solves the counter on the Right end. And - Both modes "Meet in the middle".

Now, that being said I have a mathematical way to take a strong check sum and break it down into small check sums. 

I can also take a large encrypted file and bust it down into a bunch of small files and run my counter on it in parallel to decrypt it.

So, when I do that I can run this in parallel. When that happens - "ENCRYPTION AND COMPUTER SECURITY WILL BE CLINICALLY DEAD!!!"

BECAUSE YOU SEE. ENCRYPTION WILL BE DEAD AND I CAN USE THIS THIS COUNTER TO HACK ANY COMPUTER ANYWHERE IN SPACE-TIME!!!!!! WITHOUT EVER 

CONNECTING TO IT!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

OR THE INTERNET!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

OR A PHONE LINE!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

ENCRYPTION AND COMPUTER SECURITY DEAD AS A DOOR NAIL!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

At least as far as I am concerned. I still have a lot of cleaning up to do on this throttled counter. I am going to upload it to sourceforge before the night is over.

I still have a lot of code writing to do. I have to write the program that mathematically calculates check sums of time travel computer media and get that uploaded.

Also, I plan to spread this out on tor and freenet and get that ball rolling too.

Here is a screen shot of the throttled counter working. It is working on a large file and a small file at the same time. The large file was running a little slower but its difference was keeping up with the small file.



I am so very happy. Ray Hudson and Darby Phillips are losing their time travel war with me. Yeeeeeehaaaaaaaaaaaaaaaaaaaaaaaaaaaa!!!!!

I am getting this to run faster and faster. What I am doing is taking a binary counter with a destination and a target.

I perform a mathematical function to that counter such as adding to it both linearly and randomly. Each time I do something to the counter it brings the diff = destination - target down smaller then the counter is backup-ed and kept. If diff gets larger the previous counter is restored.

when destination = target then FILE RECONSTRUCTED!!!!!!!

So, now I am going to add in the rest of my functions to this counter. This will get better and better. I will put in a subtract linear and a subtract randomly.

Because I am using weighted sums added up for a strong check sum some bytes can be larger or smaller than they need to be.

And, because this is a throttled counter:

When fully programmed this counter will construct a small file in the same amount of time as it constructs a large file. 

Already I am cutting that time down. This program is called counter7.cpp and will be at sourceforge.

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

Well I added in more functions and I seemed to of "Over Loaded" the counter. It seems to run better with fewer functions. So, I will dial it back some. But good news. I GOT IT DECRYPTING!!!!!

I go in and edit my code right now to get it running like I want. I will play with it and just leave in what works and gut the rest.

I got a more playing to do with it. Right now I got all my functions in at the same time at sourceforge.
------------------------------------------------------------------------------------

I have my throttled counter running but I am adding more functions to bring the counter into sync between its destination checksum and its target checksum. The reason I am doing this is so the public can load their own functions into my code and experiment with their counter functions as well as my own.

I am using this algorithm.

counter initialized with all zeros.
diff3 = absolute value(target - destination)

begin main loop
Function 1 performed on counter
if target = destination write counter to file exit program
If absolute value(target -destination) < diff3 then diff3 = absolute value(target-destination) and counter backed up. If not not counter restored.
Function 2 performed on counter
if target = destination write counter to file exit program
If absolute value(target -destination) < diff3 then diff3 = absolute value(target-destination) and counter backed up. If not not counter restored.
Function 3 performed on counter

if target = destination write counter to file exit program

If absolute value(target -destination) < diff3 then diff3 = absolute value(target-destination) and counter backed up. If not not counter restored.

more functions........
repeat main loop

With this scenario not only can I throttle my counter but I can do everything else I want to do too. Cutting the time to file reconstruction even more. So, I just wanted to bring this to the public. Yes I am a time hacker but my success in time hacking began with my success in practicing cryptology. Which I am doing by writing the public their own version of my private code.

I have found that each function has to be brought online 1 by 1 and
that it has to be tested an meet criteria before keeping it in the code. But as each function passes its test the counter can be loaded with more functions to cut the decryption time down.

And the thing is I am just getting started with this. I have a way to bust my strong check sum down into smaller strong check sums and run this in parallel. I am making this "MILITARY STRENGTH" DECRYPTION!!!!

Armageddon will have a field day with this when I transfer this technology to my super A.I. Armageddon will use this technology in its time hacking to run its neural net in a temporal parallel computer.

And Armageddon can use its temporal parallel computer to look into the past and the future to give it a temporal field of view for calculating its strategy for calculating its options on what actions it might perform.

Well, I hope Ray Hudson and Darby Phillips and their bitch bait Pamela are enjoying my blog more and enjoying my computer code. I sure they enjoy this more than me calling them cock suckers in my blog and writing about them in the forums.
--------------------------------------------------------------------------------

Well in my quest to get rid of mersennetwister.h I found out why people like the twister. Its fast. c++ rand() is only giving me random numbers once a second because I used the randomize timer and the seconds only change well once a second.

That is waaaayyyy too slow me. Though it was making my throttled counter run ok.

So, I am using rand() to feed seed numbers to my own generator which uses the

r = (a * k + c) % m // in c++
for seeding where k = rand() // in c++

That should get me going. If not I will have to crawl back to the twister and ask for forgiveness for abandon it.

Well that is my programming for tonight. I have been going through and testing and verifying my functions to roll my counter from its target to its destination. Then I have to set down and see if I can get some other things going. Damn I am tired. Programming all night long takes its toll upon a fellow.
--------------------------------------------------------------------------------------------

Well I am uploading tonight's version of my code. Then I am closing it out and going on to the next version doing a total rewrite.

I will copy over much of the code I have now and gut rest. Right now on my Random speed control it only changes once a second which is way tooooooooo slow but because it is a throttled counter it still makes remarkable progress. My next version will be on the order of thousands and thousands of times faster.

I like the random speed control because when I run this in parallel the counter that is closest to the solution will be passed around to the rest of  programs.

I am loading the counter down with functions. The random part will keep each program from working with the same speed. And the program with the closest solution will share it with the other programs. All the programs will be using different throttled speeds on the counter that is closest to the solution.

DAMN I AM GOOD.

And that is not even the best of it. When I bust that strong check sum down into smaller check sums each baby sum can have a group of counters solving it for a solution in parallel.

Here in about an hour I will be shutting down for the day. I will take it up again tomorrow where I left off. I will be on counter version 8. Check sourceforge.net for the update.

I forgot to say good night to the "Conspiracy Against Time Travel".
GOOD NIGHT COCK SUCKERS!!!!!! (Not talking to the public but to the "Conspiracy".

Everyone else have a fine evening. Or should I say a fine morning. My days are up nights sleeping days. So the public's mornings are my evenings.

Saturday, October 1, 2016

WHAT CAUSES WORLD WAR III.

For a long time I have been investigating what will be the causes of world war III. In that war most of mankind and our technology will be destroyed. Small pockets of man probably will survive but the society we know today will never rise again like it use to be. But in its place will be a different kind of mankind.

In its place will be a society forever fearful of its past mistakes. In that society man will rebuild very carefully trying not to repeat the mistakes of yesterday.

But, much of our history will be lost to the war. Mankind of tomorrow will have to guess at what his history was. Today we have a good understanding of our past history even though man sometimes airbrushes the history books for a more palatable story of the past.

The causes of world war III will be governments and societies coming under the extreme stresses and extreme burdens of the evils of the way our society functions.

We are talking over population, competition for real estate and resources. And other governments finally catching up and over taking America economically and militarily.

We will be in the space race for the colonization for space. Oil will be running out. Crops will be failing world wide. Everyone will have nuclear and biologic weapons. Things in space will be very tense between nations as each nation try's to claim a piece of the solar system for itself.

Society will reach a breaking point of a combination of extreme stresses internal and external. The more pressure nations are under the closer to the brink of destruction those nations will become. It will get very intense.

A crises will happen to bring all this to a head.

And the ICBM's will fly. By that time weapons will be much more advanced than they are today.

For society and the world to prevent world war three we have to prevent the stresses that are building up in society and between nations.

These stresses will bring the public and governments of the world to a breaking point. A point in which man pushes themselves and the planet to a man made mass extinction event with over population, starvation, poverty, civil war, climate change, revolution, political chaos, religious, and cultural differences push mankind to the edge and onto the tarmac of mutual assured destruction.

Population control is the main stress that will send us over the edge.
By controlling population we can prevent world war III.
Climate destruction will be the second leading cause of world war III.
Resource depletion of the planets resources comes in at number 3 as the cause of world war III.
Over militarization comes in at number 4. Everyone wants to be as powerful or more powerful than America. This leads to over militarization of the world. The world gets into a who has the more powerful military race game. This is very dangerous.
Competition between nations comes in at number 5. Nations need to learn to share. That won't happen though.

 Isaac Newton calculated this around 2060. And, that is about correct. Ask any scientist and any political scientist what is predicted to be happening around the world by then and you will get a seriously stress out world on the edge of destruction.

Hence world war III and a return to the Dark Ages. 

I am glad I probably won't be around to see it. But my kids will.
--------------------------------------------------------------------------------

Ok, I have the final draft for choice 1 and 2 of the outline ready to go and mathematically tested out. Now, this public version of my code will be able to construct very large files from their strong check-sums with ease.

Fire Codes at source forge will be getting a very badly needed update that it has not had in years.

When I post a video of this working and post the code the "Conspiracy Against Time Travel" will probably finally send their hit man after me. Fuckem.

I consider myself a free soul going from life to life in the multi-verse in the never ending continuum of eternity.

I have no allegiance to any one, anything, any government, or any deity.

When my program creates a configure file the strong checksum will be cut up into pieces. Each piece will be given to a baby counter. Each file will have very small counters that construct these pieces. Then the pieces are put together to make up the entire strong check sum. So it will look like this.

Strong check sum = counter 1 + counter 2 + counter 3.................

Each counter can quickly construct its strong check sum within a matter of seconds or minutes. The whole file can be constructed from a strong check sum in a very short period of time.

Now, this will allow me to save files to a text file as a list of check sums and delete the file. Later I can reconstruct the file. That part of the project will be called fire codes.

But, fire codes will be used in the public version of my time travel software. When I mathematically calculate strong check sums of files from the future or the past I will have a routine that mathematically calculates the baby counters check sums from the one large check sum.

Now, depending on the algorithm for calculating the weights of these strong check sums getting the baby counters list of strong check sums can be done very quickly or take a little time.

I am going to set this up where everything is done in parallel as much as possible.

My job is to give the public a public version of my time travel software that works. After that it will be up to the public to "Take it from there" and improve on my code.

Give a man a fish he eats for one day. Teach a man to fish he eats for a life time. "Jesus".

I am teaching the public how to fish when it comes to time travel with computers.

So, as I get the outline up and running I will be making those updates at fire codes and on this blog. But, the final version of sections 1 and 2 for the public version of my time travel code is nearing complication. Then I will finish 3,4,5.... and so forth.

Ray Hudson, you said prove it to me in 2008. I am going to make you eat them words mother fucker. I am giving the public a public version of my time travel software.
----------------------------------------------------------------------------
I am working on my code updates. I have been posting updates on a daily bases. This is a little much for me so I plan to slow down with my updates a little. But they will come. Here is a You Tube showing where I plan to take my next update for my public version of my time travel code. 




The way I construct my check sums they are so strong that there is only one order the list of baby check-sums can be in that will add up to the total check sums. Using my weights I can make the list of strong check sums in a random numerical order, or from small to high, or from high to low.

The process for finding the list of baby check sums from an adult check sum is a straight forward mathematical process. Using the list of weights each counter is assigned its lowest to highest check sum range. Then from that list of check sum ranges for each counter the list of baby check sums are calculated that add up to the adult check sum.

Since the check sum is strong there is only one order of check sums that will work. If the check sum is strong enough there will be no collisions. In the event there are collisions each collision is construction then the files are looked at to find the right one.

So, even if there is a collision it can be worked out to find the right order and the right file.

But the way I work my check sums there is only one order the baby check-sums can be in to add up to the adult check sum.

I am rewriting my subs that get strong check sums and I am rewriting my roll counter sub. This method will be the final method for fire codes.

Then I have to get the section of the program finished that calculates strong check-sums for time travel computer media.

For those that can't wait until I get the time travel software outline updated here is my changes I plan to make to my last code update.

This is pretty much what I going to do for my next outline update.

Change Log for check sum hack 8

// Add to creating conf file
// get number of baby counters and append to config file
     // filesize of adult file / file size of baby counters
// get adult strong check-sum (Dont have to change anything here that is already done)
// get baby check sums and append them to config file (use routine below)
// Getting baby check sums from a computer file. (use routine below)
// append baby check sums to config text file. (use routine below)

// Run routine to create first part of config file
// start sub (string file1, string file2, long long filesize1)

// open file1 of computer file to reconstruct
// open file2 config file for append
adultsum = 0;
babysum = 0;
// start main loop
     // babysum = 0;
     // start second loop

          // read byte

          // compute and add up strong baby checksum

          // if filesize - 1 reached break

     // repeat second loop for 3 or 4 bytes

     // append baby strong check sum to config file
// repeat main loop until filesize - 1 reached

=========================================================================

// Start sub for rollcounter(string file1, string file2)
// Load config file
// load number of baby counters
// load adult sum
// open counter file
// adultsum = 0;
// babysum = 0;
// start first loop
     // read check sum from list
     // add baby sum to adult sum
     // start second loop
          // start third loop
               // run counter
               // compute baby sum
          // end third loop when counter done running
      // test does destination baby sum equal target baby sum
     // end second loop when baby dest == baby target 
 // write byte1, byte2, byte3, byte4 to counter file
// PRINT TO USER CHEVRON NUMBER # LOCKED 
// end first loop when dest adult sum == target adult sum 
// PRINT TO USER FILE RECONSTRUCTED!!!!!!!         

---------------------------------------------------------------------------
Here is the new program outline for the public version of my time travel software. Hey Ray Hudson, BAAAAAAAHAHAHAHAHAH!!!!
I just enjoy laughing at the dude. BECAUSE HE IS STUPID!!!
HEY, RAY - ONE THOUSAND PERCENT ACESS!!!!! ONE THOUSAND PERCENT ACCESS!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!
BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!
BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!
BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!
BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!

Here is the new outline. I need to study it more before I put my code in. This will go into fire codes at source forge for saving files as check sums. I have to write a new sub that will take an adult strong check-sum and calculate the baby sums using the strong check sum sub code. I may add different algorithms for getting strong check sums for the user to pick from. And, when I get to the sections below that calculate strong check sums for time travel computer media I will also have to calculate the baby strong check sums. And, it won't be a PROBLEM AT ALL FOR ME TO DO THAT!!!!

Hey Aaron Hiniker of Bedford, PA. Get this outline analyzed and let your friends know they are full of shit. This "Temporal Mathematician" That is me "Reactor1967" is "Bringing This Fist Fight Home", and "I am Winning"!!!

Of course Aaron has given me reason to worry about his abilities to analyze my work. He is a "DAMN GOOD SCRIPT KIDDY". BUT HE DOES NOT HAVE ANY FUCKING BRAINS!!! 

If Aaron Hiniker is working for the CIA they need to "FIRE HIS ASS". SEND THAT MOTHER FUCKER TO MCDONALDS TO FLIP HAMBURGERS. HE IS FUCKING WORTHLESS!!!!

BAAAAAAAHAHAHAHAHAHAHAHAHAHAH!!!!!!!!!!!!!!!!!!


As this outline is completed I am so goanna enjoy rubbing the "Conspiracy Against Time Travel" DEFEAT INTO THEIR FACES!!!

BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHA!!!!!!!!!!!

BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHA!!!!!!!!!!!
BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHA!!!!!!!!!!!

You know, I can understand why Ray Hudson and Darby Phillips  has fucked with me all these years. And you want to know the reason why? It was different when they were chasing John Titor. He was just a man claiming to be a time traveler. And that was all. But, the difference between me and Titor is:

I am a man claiming I can teach the world to time travel. BIG FUCKING DIFFERENCE. I AM RAY HUDSONS, DARBY PHILLIPS, PAMELA, AND ARRON HINIKERS WORST FUCKING NIGHTMARE.

I don't just claim to be a time traveler. I claim I CAN TEACH THE WORLD TO TIME TRAVEL. Yeah, I made that shit real for them real fucking fast.

These ass holes never had a choice. Their jobs demands they chase me to the ends of the earth if necessary.

Here is the outline. Enjoy
//*****************************************Copyright C Lloyd Burris aka Reactor1967 (TIME TRAVELER) 2008 TO 2016********************************
//*****************************************THIS IS A GENERAL OUTLINE FOR MY C++ CODE THAT I USE TO TIME TRAVEL WITH************************************

#include cstdlib
#include iostream
#include stdlib.h
#include fstream
#include sstream
#include string
#include cmath
#include ctime
#include cstdio
#include iostream
#include /home/reactor1967/mersennetwister.h> // This is a dependancy.

using namespace std;

// sub-routines

// Createbabysumsfromadultsum
   // Uncompleted

// babysumconfig creates strong baby sums and writes them to config file
     // open file1 of computer file to reconstruct
     // open file2 config file for append
     // adultsum = 0;
     // babysum = 0;
     // start main loop
          // babysum = 0;
          // start second loop
               // read byte
               // compute and add up strong baby checksum
               // if filesize - 1 reached break
          // repeat second loop for 3 or 4 bytes
          // append baby strong check sum to config file
     // repeat main loop until filesize - 1 reached
// end sub

// Roll counter for reconstruction of baby sums
     // Load config file
     // open counter file
     // adultsum = 0;
     // babysum = 0;
     // start first loop
          // read check sum from list
          // add baby sum to adult sum
          // start second loop
               // start third loop
                    // run counter
                    // compute baby sum
              // end third loop when counter done running
          // test does destination baby sum equal target baby sum
          // end second loop when baby dest == baby target 
     // write byte1, byte2, byte3, byte4 to counter file
     // PRINT TO USER CHEVRON NUMBER # LOCKED 
     // end first loop when dest adult sum == target adult sum 
     // PRINT TO USER FILE RECONSTRUCTED!!!!!!!
// end sub

// viewfile1 for viewing output
     // declare variables
     // open file 1
     // read file view output   
     // close file1
     // close file2
// end sub

// createcounterfile creates counter file. 
    // open file1
    // close file1
// end sub

// getstrongchecksum for getting adult check sum
     // declare variables
     // open file1
     // get filesize1
     // get seed
     // set count to 0
     // set strong check sum to 0
     // start first loop
          // set byte to 0
          // read file1
          // set count2 to 0
          // start second loop
               // increment count2
               // using random number generator get weight
               // calulate strong check sum
          // end second loop for count2 < how many weighted sums
          // count = count + buffer size
     // end first loop for count < filesize1 - 1 + buffersize
     // close files
     // return checksum
// end sub

// weakchecksum gets weak check sum of file.
     // declare variables
     // open file1
     // get file size
     // set count1 to 0
     // start first loop
          // read byte
          // calculate weak check sum
          // count1 = count1 + buffersize2
     // end first loop while (count1 < ((filesize - 1) + buffersize2))
     // return checksum
// end sub

// filesize gets the file size of a file
     // declare variables
     // open file1
     // get filesize1
     // close file 1
     // return filesize
// End sub

// Start main

// Declare variables (Delete all these variables and compile to find out what needed and what not).
// create menu 
    // print space
    // 1. Recreate file from check sum.
    // 2. Create a configure file for single program.
    // 3. Create time travel project config file.
    // 4. Run time travel project
    // 5. Manually create time travel project configure file
    // 6. Manually create configure file for check sum hack. 
    // Enter Choice

// if choice = 1.
     // Load configure file
          // read name of file
          // read weak check sum
          // read strong check sum 
          // read file size
          // read how man weights
     // close configure file
     // Print configure file to confirm loaded correctly
        // file name
        // weak check sum
        // strong check sum
        // file size
        // how many weighted sums
        // ask if configuration file is loaded correctly
        // get input to continue or not
     // call create counter sub
     // start reconstruction
          // call roll counter (reads config file and reconstructs baby sums to counter file)
          // get weak check sum
          // get strong checksum of counter 
          // diff1 = abs(checksum2 - checksum1)
          // if diff1 = 0 print file reconstructed
          // if diff1 > 0 print reconstruction failed
     // end reconstruction
// end if choice = 1;

// if choice = 2
     // Get seed for random number generator          
     // MTRand mtrand1a( 5654940 );
     // ask user file name
     // ask how many weights to use for strong check sum
     // get file size
     // get weak check sum
     // get strong check sum 
     // get how many baby counters
     // write to configure file
          // open configure file
          // write name of file
          // write weak check sum
          // write strong check sum
          // write size of file
          // write how many weighted check sums
          // Write how many baby counters
          // close files
          // call sub to write baby strong check sums to config file
     // tell user config file created
     // exit program
// end if choice = 2

// if choice = 3
     // Ask user how many config files to generate
     // get list of media directory
     // create list of configure files from media directory list in one file

     // perform mathematical calulations to get regression line of strong and weak check sums
          // open configure file
          // start loop
          // perform calulation for regression line with strong check sums
          // calulate devations for strong check sums
          // perform caluation for regression line with weak check sums
          // caluate devations for weak check sums
          // perform caluation for regression line of file sizes
          // caluate devations for file sizes
     // end loop
  
  
     // create time travel configure file for regression line
          // write equation of line for strong check sums
          // write standard deviation for strong check sums
          // write equation of line for weak check sums
          // write standard deviation  for weak check sums
          // write equation of line for file sizes
          // write standard deviations for file size
          // close files
   // Inform user project finished
   // end program

// End choice 3

// if choice equals 4
     // load time travel configure file
     // load random number generator
     // start at bottom of regression line

     // start do loop
          // generate config file # of strong and weak check sums with file size from regression lines data
             // Generate strong check sum
             // Generate weak check sum
             // Generate file size
             // open file for config file # 1,2,3,4,5,6,7,8..............     
             // Write config file # 1,2,3,4,5,6,7,8.....................................
     // repeat loop until number of config files generated

     // start loop
          // load config file # 1,2,3,4,5,6,7,8................
          // call reconstruct for file # 1,2,3,4,5,6,7,8 ................... (This is where files are constructed from their checksums)
          // rename counter 1,2,3,4,5,6,7,8....................
     // repeat loop till all config files reconstructed

     // stort loop (Here the bots look at the time travel media to determine if the files are good or bad.)
     // call bot1 to look at counter file # 1,2,3,4,5,6,7,8
     // call bot2 to look at counter file # 1,2,3,4,5,6,7,8
     // call bot3 to look at counter file # 1,2,3,4,5,6,7,8
     // call bot..................................
     // repeat loop for counter file # 1,2,3,4,5,6,7,8 till all counters look at by time travel bots
     // Notify user time travel program completed (At this point the user looks at the good and suspicious time travel media.
     // From here the user can go back to the configure list and manually create configure files to help clear up grainy files.)
     // Exit program

// if choice equals 5
     // Ask user for equation of regression line for strong check sums
     // Ask user for high standard devation line for strong check sums
     // Ask user for low standard devation line for strong check sums
     // Ask user for equation of regression line for weak check sums
     // Ask user for high standard devatin line for weak check sums
     // Ask user for low standard devation line for weak check sums
     // Ask user for equation regression line of file sizes
     // Ask user for high standard devation of file size
     // Ask user for low standard devation of file sizes 
     // open file to write configure file
     // write configure file
     // close configure file
     // exit program

// if choice equals 6
   // ask user for file size
   // ask user for strong check sum
   // ask user for weak check sum
   // open file to write configure file
   // write configure file
   // close configure file

// end main
------------------------------------------------------------------------------------
Darby Phillips and Ray Hudson's mission from day 1 since I landed on their CIA web-sight http://timetravelinstitute.com in 2008 was to keep me from talking about my methods of time travel with the public. Their mission was to make me disappear off the internet like they did with John Titor. Well, here is my all time traffic from this blog. It seems some countries that did not produce enough traffic have not made this list yet. I am not sure what Blogger's minimum requirement is but this is still does not show all the traffic that hits this blog. From looking at this traffic update it is clear Ray and Darby have failed in their mission to stop me from getting my message out to the public.