Thursday, January 26, 2017

Upgrading Time Travel Computer Code

COPYRIGHT(C) 2017 http://time-travel.institute

Copy of public version of time travel computer code at http://sourceforge.net/projects/timetravelproject/


01/26/2017 10:00 PM


I am fixing to upgrade from counter 11 to counter 12 then write my base power counter to run in memory. Then finish up fire codes project generators. Then upgrade my configure file generators and number generators in all my projects. After that I will look at bringing the Burris Numerical System into "Time Travel Project" at sourceforge.


After I finish getting the bottom half of my code upgraded I have to get the top half of my code upgraded. The bottom half of the code is the time travel vehicle itself. The top half of the code is the time travel guidance and control systems. Both half of the codes make up an entire time machine. Off to work.  Talk to everyone later.

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

01/26/2017 11:38PM


I am got a start on counter 12. Before I can finish it I have to write a program that will generate a random binary file for the destination file starting out or the user can give one. Then I have to use a tool to get a strong check-sum of a good file. Then I will program counter 12 to recreate that good files strong check-sum. This is the part of the program that maps every computer file in space-time to a number that can be re-constructed by this program.


Now this part is the guidance and control system for the program. These two things is how you build a computer software program that can time travel. The top half is the guidance and control the bottom half is the time travel vehicle itself. This part starts out using a random destination file. But every time it gets closer to its target strong check-sum it will recycle its old target file to its destination file. This is called the pendulum algorithm. It will do this until it finally hits its target strong check-sum.

Then the pendulum comes into balance with its fulcrum. It works in physics and it works in cracking check-sums too and decoding them to computer files.

It can be shut down by deleting its lock file. When that happens it writes its destination file and its closest target file to the hard drive. to begin anew the next day. The destination and the target is the control counter and the experimental counter. Then a new low is reached the experimental becomes the control and the control becomes the experimental until the pendulum is in balance with its fulcrum.


When that happens the destination check-sum will equal the target check-sum and the file WILL BE RE-CONSTRUCTED!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

THIS GIVES PRECISION CONTROL FOR COMPUTER TIME TRAVEL. IT GIVES PRECISION GUIDANCE AND CONTROL FOR COMPUTER TIME TRAVEL.

In the beginning I spent most of my time writing time travel code for myself and computer time traveling and pissing off the "Conspiracy Against Time Travel" by not leaving the internet as they had ordered me to do.


Now, in my fight against the "Conspiracy Against Time Travel" I now spend my days writing time travel computer code for the public while doing very little time travel myself. This is the best way I can fight them. To show them who is the boss. I am the boss of myself. They are not my bosses and never will be.

----------------------------------------------------------------------------------------------------------------
01/27/2017 07:57AM

This morning I was looking at some time travel media and I realized that as time goes on it becomes irrelevant to the present except when the past was ahead of the present. Except for a very few small pockets of science and special people like myself.
---------------------------------------------------------------------------------------------------------------------------------
01/28/2017 12:08 AM

I was going to write a project generator for fire codes but I realized I already had a project generator. So, instead of feeding random binary to fire codes to generate project files it is far faster to use the binary generator to generate time travel media. Then after the robot gets done checking the files feed the good files to fire codes. This would be good for encrypting time travel media since fire codes has to have a password to decode a config file. So, I am done with fire codes. I put the binary generator project with fire codes. I guess I should write a file wiper and get Predator up and running in c++ so people can clean the computers of time travel media files.


I got a lot of experimenting and updating to do to make this production level computer time travel.


I got my buffer working in the binary generator. I was generating 500 mega byte files in a couple of seconds. SO I CAN FLASH LIGHTING GENERATE TIME TRAVEL MEDIA FILES NOW. Now I should turn my attentions to the guidance and control systems. I think I have enough time travel media vehicles. I still got to rewrite my base power counter but it works right now.


My binary generators is where the real computer time travel will probably occur. I have to treat the binary files as numbers in a numerical base and define ranges in those numbers where I think time travel media files will be. So I could work on software now that looks at files as numbers. It can be used for all the projects including fire codes. 


So guidance and control is where I will go next.

------------------------------------------------------------------------------
01/28/2017 01:41 AM

Ok, I just went over the guidance and control aspect of this really well. To get computer time travel media files Weighted Strong Check-sums are the coordinates to use on the space-time informational universe. I need to try to find my old version of fire codes because it had software that can generate files by their strong check-sums. So, If I don't find that I will have to rewrite it.


Counter 12 is the best way to go to a specific strong check-sum and so is my binary generators and my tools.


The file generators must generate files within the specific high low range of two weighted strong check-sums. Any files within that specific range are possible time travel media files.


So, my programs already do this each one does it in its own way. I may do some more playing around and see what I can do.


So what I should do now is start using my own software to computer time travel and tweak it as I go along. The world is welcome to use it and tweak it to their own needs as well. So that is where I will go next. I'm off to computer time travel.

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

01/28/2017 06:32AM

I time hacked my butt off this morning and found a bug and wrote a counter. I'm going to have two types of number generators. One is purely random and the other will generate files and check-sums with in ranges. And I had a little trouble with my random number files. But it is all getting worked out.
----------------------------------------------------------------------------------------------------------------
01/28/2017 05:08 PM

Well I'm setting here this afternoon working on updating my file and check-sums generators. I realize two things. If random in ranges or not the numbers must be purely random. Second purely the files must come to numbers in a numerical base that are real files and for that I must add to them to take them up in value or subtract to take them down in value. 

So for my generators that work in ranges I will add, subtract, and compare to generate check-sums and files for time travel computer media. I will take a number in a numerical base and run it up till it surpasses it's high value then reverse it till it passes it's low value scanning a range for time travel computer media. It will be called scanner.cpp

The other file generator will be a random time travel media cracker. It too will work in a programmed range in a number in a numerical base using random numbers within a defined range. The user can make that range as tight or as loose as possible. 

With both methods it must be possible for the user to pick a target within a range and have the file or check-sum generates to hit that target. 

The algorithm I am going to use to hit my targets is simple. In mathematics with 3 variables if any two variables are known the third can be calculated. So I have a high variable and low variable. Now all I need is + or - the difference. And my check-sum or file generators will use the difference mathematically find their target.

Now, as I did with my fire codes and base power check-sums I have to prove they work. So the test will be taking a known file and proving my file generater can find it and post that video on you tube. 

So these file and check-sum generators are given a high value and low value then will be spoon fed differences to find their target values.

Now since I have mapped all computer media files in space-time as numbers my that my software can construct my only job left is to define the guidance and control system. The plan I outlined above will allow me to do that.

And again I want to again ask the world to take my computer time travel and make it their own and use it for free. This is open source and my gift to the world to fuck the conspiracy against time travel up the ass hole with a very large dick.

Take this computer time travel world. Take it. Use it for what ever you want. It's yours for free. Use it however you want.

Next step then is finding unknown time travel media files then getting that video posted on you tube.
----------------------------------------------------------------------------------------------------------------
01/28/2017 08:30PM

On my guidance and control systems for time travel project.

On the file and check-dum generators it will be just two high low numbers in a numerical base. They will be fed a directory full of differences and the results will be the target files and check-sums. Those differences between the numbers can be calculated how ever the user wants. I of course will  have one or more programs to calculate those differences.

The difference files will be both text and binary.

These programs will re place the check-sum and file generators in time travel project.

I already have a free space wiping program. My encryption program will be my file generator where the user generates a difference file with a file size and password and the user can take a known file and roll it to an encrypted file with the add 2 files tool or subtract 2 files tool. And do the reverse to unencrypt it. So, with the file generator and the add or subtract tool in time travel project a computer file can be encrypted.
--------------------------------------------------------------------------------
01/28/2017 10:49 PM

I am sitting here drinking coffee. I got a fire going in the fire place. I am fixing to sit down and start coding the file generator for time travel project. 

I have to do one with binary files for the file generator and one with text files for my base power check-sum. The counter project already goes to its target though I need to get some more bugs out of it.

This will not take long. In fact I all ready have the add and subtract two file program written. But, I am going to make it a little better than that.  The program takes two files. A high and low file. 

Then it gets a strong check-sum for both files. The strong check-sums is how I tell if a file is bigger or smaller as a number in a numerical base than another computer file. It is how I compare two files as numbers in a numerical base. 

The stronger a weighted sum is the more accurate it is. I like weighted sums because I am make them as weak or strong as a check-sum as I want. I control the strength of that check-sum.

Then it excepts a file list of difference files generated by the file generator. It will go through and get a strong check-sum of the difference files and as long as they are equal too or between the strong check-sums of the high and low file then the program will use the difference file and add or subtract it and generate a target file. That is it. Now with that any time travel computer media between the two files can be found. And I will prove it with a You Tube video like I did when my base power check-sum counter and fire codes and my other counters as well.

Once I have that guidance and control system proven for finding time travel computer media and I have already proved my counters for mapping all files in space-time to a number and coding and decoding them then the computer time travel machine on sourceforce will be upgraded. And my revenge against the "Conspiracy Against Travel" will be upgraded.

On the file generater for the base power check-sum the same thing will happen except with text files. It will be no different than the binary files. A high and low base power check-sum is generated. Then  the program is given a list of difference check-sums which are added or subtracted from the high low check-sums to hit the target check-sums in between. Then the targets are decoded as computer files.

On my base power check-sum the next upgrade will be expanding my buffer size reading the binary program. The base power counter uses two numerical bases. One for reading binary files and one for converting the base power check-sum to a number in a numerical base. So, I am fixing to lite a fire under its ass. That 16 bytes per minute will go way up. That is where I am for tonight.

After I get my guidance and control system finished I am going to write a program that can take a file off the file generator and manually take it up or down in value. The user can look at the strong check-sum and manually take this file up or down and manually control how fast that is being done.

Then I will start putting example spreadsheets in the project where people can map out time-lines and ranges where computer time travel media exist. You see, I actually plan to take this project and make it a full blown time travel machine and a full blown time travel project. 

All this shit I use to do with my proprietary time travel computer code before the government started coming into my home by way of my computer network, cameras, and phone. So, I am writing this time travel computer code for the public to use too since the government tried to steal it from me without paying me for it. 

In fact they owe me money for what that did but I doubt I will ever see a dime from them. Oh I'm sure Ray Hudson will probably mail me a dime in the mail to piss me off since I said it. But they did send me a gun re-loader from Israel so I guess I can't bitch too much. But still those guys are so dishonest and underhanded. 

The public is getting a computer time travel machine out of it anyway. So, someone got something out of it.

I got time travel project "ALL FIGURED OUT". This is no longer a theory and a good story on my part. Now it is in actual practice. And anyone one can use it and is welcome to improve upon it because it is open source.

TAKE THAT RAY HUDSON, DARBY PHILLIPS, AND PAMELA. 

BAAAAAAAAAAAAAHAHAHAHAHAHAHAHAH!!!!!!!!!!!!!!

BAAAAAAAAAAAAAAAHAHAHAHAHAHAHAH!!!!!!!!!!!!!!

BAAAAAAAAAAAAAAAAAHAHAHAHAHAHAHA!!!!!!!!!!
----------------------------------------------------------------------------------
01/29/2017 02:31 AM

I have the time scanner compiled for time travel project in the binary generator. Now, knowing the high range and the low range and using the file generator to generate difference files the scanner will run and construct the target files in between to construct time travel computer media files. I still have to run it and play with it but it is a standard issued time travel computer media scanner for time travel project. I need to spend some time upgrading my base power counter and its guidance system too. 

So without further ado and because I just know Ray Hudson is dying for me to post my time travel computer media code HERE IS THE "TIME SCANNER!".

// Begin time scanner code //////////////////////////////////////////////////////////
// COPYRIGHT(C) 2017 http://time-travel.institute
// This program takes two files. A high file and low file.
// Then it reads a file list of files it will subtract from the high or add to the low. 
// The user tells whether or add or subtract.
// Make a file list first like this ls > list.txt
// Then edit the list for any unecessary files.
// Run the program like this // ./ProgramName Buffersize HighFileName LowFileName FileList addsubtract extension
// from the command line.
// It will output target files.
// This works on the principle that if you know any two variables you can calculate the third
// So we we know our high range and our low range and the difference we can calculate your time travel media target file.
// You will have to use a random binary file generator to make the difference files. There is one at http://sourceforge.net/projects/timetravelproject/
// ============================================================================================
// Declare includes
#include cstdlib
#include iostream
#include stdlib.h
#include fstream
#include sstream
#include string
#include cmath
#include ctime
#include cstdio
#include iostream
#include "timecheckhacking.h"
// timecheckhacking.h available at http://sourceforge.net/projects/timetravelproject/
// ============================================================================================
// Declare namespace
using namespace std;
// ============================================================================================     
// declare subs
// ============================================================================================
int add(long long count3, int buffersize, string destinationfile, string differencefile, string extension)
{
         
        long long filesize2;
        long long filesize3;
        long long filesize4;
        long long count2;
        long long carry;
        int byte;
        int byte1;
        int byte2;
        int byte3;
        long long numberbase = (buffersize * 255) + 1;
        string pause;
        string whatdo;
        string file1;
        int dummyfile;

        // get filesie 2
        filesize2 = filesize(differencefile);


        // get filesize 3
        filesize3 = filesize(destinationfile);

        // if filesize 2 > 3 then filesize 4 = filesize 2
        if (filesize2 > filesize3)
        {
             filesize4 = filesize2;
        } 
        
        // if filesize 2 < 3 then filesize 4 = filesize 3
        if (filesize2 < filesize3)
        {
             filesize4 = filesize3;
        }

        if (filesize2 == filesize3)
        {
             filesize4 = filesize2;
        } 

        // get file name  from ss
         stringstream ss;
         file1 = "";
         ss << count3;
         ss >> file1;
         file1 = file1 + extension;

         fstream myfile1(file1.c_str(), ios::out  | ios::binary);
         if (!myfile1)
         {
              myfile1.close();
              cout << "error in line 245" << " " << file1 << "\n";
              cin >> pause;
              exit(1);
         }
         myfile1.close();
         myfile1.clear();
         myfile1.flush();

         carry = 0;
         count2 = buffersize * -1;
         // start third loop
         do
         {
              // increment file variable
              count2 = count2 + buffersize;

              // set byte1 to zero
              byte1 = 0;

              // read byte1 if less than filesize
              whatdo = "read";

              if (count2 < filesize3 - 1)
              { 
                   byte1 = binaryreadwrite(whatdo, destinationfile, count2, byte, buffersize);
              }

              // // set byte2 to 0
              byte2 = 0;

              // read byte2 if less than filesize
              if (count2 < filesize2 - 1) 
              {
                   byte2 = binaryreadwrite(whatdo, differencefile, count2, byte, buffersize);
              }

              // byte3 = byte1 - byte2 - carry;
              byte3 = byte1 + byte2 + carry;

              // carry = 0;
              carry = 0;

              // if byte < 0 subtract from the base
              if (byte3  > numberbase - 1)
              {
                   byte3 = byte3 - numberbase;
                   carry = 1;
              }

              // Check for error
              if (byte3 > (numberbase - 1))
              {
                   cout << "Houston we have a problem\n";
                   cout << "byte3 greater than the base - 1\n";
                   cin >> pause;
                   exit(0);
              }

              if (byte3 < 0)
              {
                   cout << "Houston we have a problem\n";
                   cout << "byte3 less than 0\n";
                   cin >> pause;
                   exit(0);
              }



              // write random binary
              whatdo = "write";
              dummyfile = binaryreadwrite(whatdo, file1, count2, byte3, buffersize);


         // end third loop
         } while(count2 < filesize4 - 1); 
         return(0);

}
// ============================================================================================
int subtract(long long count3, int buffersize, string destinationfile, string differencefile, string extension)
{

        long long filesize2;
        long long filesize3;
        long long filesize4;
        long long count2;
        long long carry;
        int byte;
        int byte1;
        int byte2;
        int byte3;
        long long numberbase = (buffersize * 255) + 1;
        string pause;
        string whatdo;
        string file1;
        int dummyfile;


        // get filesie 2
        filesize2 = filesize(differencefile);


        // get filesize 3
        filesize3 = filesize(destinationfile);

        // if filesize 2 > 3 then filesize 4 = filesize 2
        if (filesize2 > filesize3)
        {
             filesize4 = filesize2;
        } 
        
        // if filesize 2 < 3 then filesize 4 = filesize 3
        if (filesize2 < filesize3)
        {
             filesize4 = filesize3;
        }

        if (filesize2 == filesize3)
        {
             filesize4 = filesize2;
        } 

         // get file name  from ss
         stringstream ss;
         file1 = "";
         ss << count3;
         ss >> file1;
         file1 = file1 + extension;

         fstream myfile1(file1.c_str(), ios::out  | ios::binary);
         if (!myfile1)
         {
              myfile1.close();
              cout << "error in line 245" << " " << file1 << "\n";
              cin >> pause;
              exit(1);
         }
         myfile1.close();
         myfile1.clear();
         myfile1.flush();

         carry = 0;
         count2 = buffersize * -1;
         // start third loop
         do
         {
              // increment file variable
              count2 = count2 + buffersize;

              // set byte1 to zero
              byte1 = 0;

              // read byte1 if less than filesize
              whatdo = "read";

              if (count2 < filesize3 - 1)
              { 
                   byte1 = binaryreadwrite(whatdo, destinationfile, count2, byte, buffersize);
              }

              // // set byte2 to 0
              byte2 = 0;

              // read byte2 if less than filesize
              if (count2 < filesize2 - 1) 
              {
                   byte2 = binaryreadwrite(whatdo, differencefile, count2, byte, buffersize);
              }

              // byte3 = byte1 - byte2 - carry;
              byte3 = byte1 - byte2 - carry;

              // carry = 0;
              carry = 0;

              // if byte < 0 subtract from the base
              if (byte3  < 0)
              {
                   byte3 = byte3 + numberbase;
                   carry = 1;
              }

              // Check for error
              if (byte3 > (numberbase - 1))
              {
                   cout << "Houston we have a problem\n";
                   cout << "byte3 greater than the base - 1\n";
                   cin >> pause;
                   exit(0);
              }

              // Check for error
              if (byte3 < 0)
              {
                   cout << "Houston we have a problem\n";
                   cout << "byte3 less then 0\n";
                   cin >> pause;
                   exit(0);
              }


              // write random binary
              whatdo = "write";
              dummyfile = binaryreadwrite(whatdo, file1, count2, byte3, buffersize);


         // end third loop
         } while(count2 < filesize4 - 1); 
         return(0);
}
// ============================================================================================
// declare main
int main (int argc, char *argv[])
{
    // Declare variables
    int buffersize;
    string highfile;
    string lowfile;
    string addsubtract;
    string destinationfile;
    string differencefile;
    string filelist;
    string extension;
    int dummyfile;
    long long count3;

    // Take command line arguments
    // ./ProgramName Buffersize HighFileName LowFileName FileList addsubtract extension
    buffersize = atoi( argv[1]); // How many bytes we are reading at a time.
    highfile = argv[1]; // High file as a number in a numerical base.
    lowfile = argv[2]; // Low file as a number in a numerical base.
    filelist = argv[3]; // filelist containing the names of the difference files.
    addsubtract = argv[4]; // Are we adding the differences or subtracting them.
    extension = argv[5]; // file extension to give to targets.

    // open file list
    fstream c1myfile1(filelist.c_str(), ios::in);
    if (!c1myfile1)
    {
         cout << "There is no file list." << "\n";
         c1myfile1.close();
         c1myfile1.clear();
         c1myfile1.flush();
         exit(0);           
    }

    // if addsubtract == add
    if (addsubtract == "add")
    {
         // destination = Lowfile
         destinationfile = lowfile;
    }

    // if addsubtract = subtract
    if (addsubtract == "subtract")
    {
         // destination file = high file
         destinationfile = highfile;
    }

    // set count3 to 0
    count3 = 0;
    // Start do loop
    do
    {
         // increment count3
         count3++; // This is the file name

         // read file list
         c1myfile1 >> differencefile;

         // if addsubtract = subtract call subtract 
         if (addsubtract == "subtract")
         {
              dummyfile = subtract(count3, buffersize, destinationfile, differencefile, extension);
         }
  
         // if addsubtrct = add call add
         if (addsubtract == "add")
         {
              dummyfile = add(count3, buffersize, destinationfile, differencefile, extension);
         }

    // repeat till end of file list
    } while(!c1myfile1.eof());

    // print to user "ALL TARGETS CONSTRUCTED!!!!!!"
    cout << "ALL TARGETS CONSTRUCTED!!!!!!!!!!!!!!!!" << "\n";

    // Exit program
    exit(0);

}
// End time scanner code /////////////////////////////////////////////////////////////
----------------------------------------------------------------------------------

01/29/2017 04:15 AM

BASE POWER COUNTER HAS BEEN UPGRADED TO USE A LARGER BUFFER!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

YEEEEEEEEHHHHHHHHHHHHAAAAAAAAAAAAAAAAAA

It just keeps getting worse and worse for Ray Hudson, Darby Phillips, Pamela my babydoll, and that little child hacker boy/pussy of Ray's Aaron Hiniker of Bedford, PA.

BAAAAAAAAAAAAAAHAHAHAHAHAHAHAHAHAH!!!!!!!

I also fixed the program that produces a base power text file for decoding.

Anyone compiling should use basepower2.h instead of basepower.h

Man I did three updates to sourceforge tonight.

And I hope all the bugs are out. I'm done for this morning programming. My fingers feel like I have been typing for hours and hours. Wait, I have been typing for hours and hours. So, I am going to type less now.

Tomorrow I will work on upgrading the file generators for base power counter. Talk to everyone later.

Oh by the way if anyone uses my software you need to generate a weight file to get strong sums and the file generators need a random number text file. So, if anyone has had problems with my code that is why. You can usually read the code and any compile errors and figure it out. My code is not that hard to read. If Ray Hudson can read it then any child from the age of 2 on up can read it. Ok, bye now.
---------------------------------------------------------------------------------





Sunday, January 22, 2017

GOVERNMENT TOOK OPEN SOURCE TIME TRAVEL PROJECT DOWN!!!!!!

COPYRIGHT(C) 2017 http://time-travel.institute

Time travel computer code at http://sourceforge.net/projects/timetravelproject/

Well I went to sourceforge to upload my files and my current files have been deleted and I have been blocked from uploading my code. My code is contained in this blog. I will have to get another web-sight to post my time travel code on.

Sorry everyone. The "Conspiracy Against Time Travel" has struck again.

I am going to create a blog page and post all my code on it when I get a chance. I GUESS NOW WE DO KNOW AND THIS IS PROOF THAT THE UNITED STATES GOVERNMENT 

DOES BELIEVE IN TIME TRAVEL. RAY HUDSON DOES BELIEVE IN TIME TRAVEL. DARBY PHILLIPS DOES BELIEVE IN TIME TRAVEL.

It was probably the C.I.A. or N.S.A. that got my code removed at sourceforge.
-------------------------------------------------------------
Later..... I did not post the time and date

I found out the problem. The "Conspiracy Against Time Travel" has infected my computer with a virus. So, I got to get that worked out. They got me again. They infected the binary files in my code knowing that would get my files deleted at Sourceforge. Yes, sounds like the C.I.A. to me.

I am going to try to remove all the binary files and just use the code only and see about getting that uploaded.
-----------------------------------------------------------
01/22/2017 04:10 AM

Ok time travel project seems to be back up at sourceforge http://sourceforge.net/projects/timetravelproject/

I have removed all binaries from my zip file. From now on everyone will have to compile their own binaries. I am sorry. I was trying to keep binaries in my code so people would not have to compile.

But, the "Conspiracy Against Time Travel" do not want anyone having the binaries let along my time travel code.

Right now I am so pissed. I am going to get time travel project to the highest level of true time travel I can and screw these mother fuckers up the ass. 
----------------------------------------------------------------
01/22/2017 0700 AM

Well I got a shot fired across my side this morning from the C.I.A. or N.S.A. I will have to be more careful in the future.
------------------------------------------------------------
01/23/2017 3:16 AM

Ok, here is my "Conspiracy Against Time Travel" HATE FUCK!!!!
REAP IT CONSPIRACY. REAP IT!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
THIS CODE WILL TAKE A COMPUTER FILE AS A POINT OF REFERENCE AND GENERATE OTHER TIME TRAVEL MEDIA FILES IN RANGE OF THAT POINT OF REFERENCE. IT USES NO CHECK-SUMS ITS A BINARY GENERATOR!!!!
THIS IS FOR FINDING THOSE LARGE TIME TRAVEL MEDIA FILES. USE THE TRAINED ROBOT WITH IT. THE ROBOT IS AT SOURCEFORGE UNDER TIME TRAVEL PROJECT
BAAAAAAAAAAAAAAAAAAAAHAHAHAHAHAHAHAHAH!!!!!!!!!!!!!!!!!!
// STARTING BINARY FILE GENERATOR
// This program will take a high file and a low file and treat them as numbers in a numerical base.
// Then this program will generate binary files between those two numbers
// Give this program the differece by using the filesize of the difference between the two files
// IF YOU RUN THIS PROGRAM AND GET A SEGMENTAION FAULT ERROR THEN YOU RAN IT INCORRECTLY. IT TAKES COMMAND LINE PARAMETERS TO RUN THIS PROGRAM.
// Compile this program like this g++ BinaryGenerator.cpp -o BinaryGenerator
// COPYRIGHT(C) 2017 http://time-travel.institute
// THIS PROGRAM IS USED FOR COMPUTER TIME TRAVEL
// program                                       buffersize filesize howmanyfiles destinationfile       seedfile                    fileextension
// This program is run like this ./nameofprogram buffersize filesize howmanyfiles nameofdestinationfile nameofrandomnumberseedfile  fileextension    
// ============================================================================================
// declare includes
#include cstdlib
#include iostream
#include stdlib.h
#include fstream
#include sstream
#include string 
#include cmath
#include ctime
#include cstdio
#include iostream
// ============================================================================================
    // Declare namespace
using namespace std;
// ============================================================================================     
// declare subs
// ======================================================================================================================
long long filesize(string file1)
{
// declare variables
    long long begin1;
    long long end1;
    long long filesize1;
    string pause;  

    // open file1
    fstream myfile1(file1.c_str(), ios::in | ios::binary);
    if (!myfile1)
    {
         myfile1.close();
         cout << "Failed to read file one line 134.\n";
         cin >> pause;
         exit(1);
    }

// get filesize1
    begin1 = myfile1.tellg();
    if (!myfile1)
    {
         myfile1.close();
         cout << "Failed to read file one line 316.\n";
         cin >> pause;
         exit(1);
    }
    myfile1.seekg (0, ios::end);
    end1 = myfile1.tellg();
    filesize1 = (end1-begin1);     

// close file 1
    myfile1.close();
    myfile1.clear();
    myfile1.flush();

// return filesize
    return(filesize1);
// end sub
}
// ======================================================================================================================
// ======================================================================================================================
int binaryreadwrite(string whatdo, string file1, long long byteposition, int byte, int buffersize)
{

    unsigned char buffer;
    char pause;
    int byte1 = byte;
    long long count1 = byteposition;
    long long begin1;
//     int buffersize = 1;
       
    // open file
    fstream myfile1(file1.c_str(), ios::out  | ios::in | ios::binary);
    if (!myfile1)
    {
         myfile1.close();
         cout << "error in line 79" << " " << file1 << "\n";
         cin >> pause;
         exit(1);
    }
    if (whatdo == "read")
    {
// cout << byte1 << " We are reading bytes " << "\n"; // debug code
         myfile1.seekg(count1);
         myfile1.read( reinterpret_cast( &buffer ),buffersize);
         begin1 = myfile1.tellg();
         byte1 = (int)buffer;
         myfile1.close();
         myfile1.clear();
         myfile1.flush();
         return(byte1);
    }
    if (whatdo == "write")
    {
// cout << byte1 << " We are writing bytes " << "\n"; // debug code
         buffer = (unsigned char)byte1;
         myfile1.seekp(count1);
         myfile1.write( reinterpret_cast( &buffer ),buffersize);
         begin1 = myfile1.tellp();
         myfile1.close();
         myfile1.clear();
         myfile1.flush();
         return(0);
    } 
     

    cout << "Error in binary read and write" << "\n";
    cin >> pause;
    exit(1);
}
// ======================================================================================================================

// ============================================================================================
// declare main
int main (int argc, char *argv[])
{

    long long filesize1;
    long long filesize2;
    long long filesize3;
    string destinationfile;
    string seedfile; 
    string extension;
    int buffersize;
    string file1; // This is the suspected time travel media file
    string file2 = "temp.bin"; // This is the file we subtract from the main file.
    long long count1;
    long long count2;
    long long count3;
    int byte;
    int byte1;
    int byte2;
    int byte3; 
    int carry;
    string pause;
    int dummyfile;
    string whatdo;
    long long numberbase;
    long long howmanyfiles;
    fstream myfile1;
    fstream c1myfile1; // Seed file
    long long seed;
                                     // program      buffersize filesize howmanyfiles destinationfile       seedfile                    fileextension
    // This program is run like this ./nameofprogram buffersize filesize howmanyfiles nameofdestinationfile nameofrandomnumberseedfile  fileextension     // passing command line arguments to program
    buffersize = atoi( argv[1]); // How many bytes we are reading at a time.
    filesize1 = strtoull(argv[2],NULL,10); // Largest file size of temp.bin to subtract from destination file.
    howmanyfiles = strtoull(argv[3],NULL,10); // This is how many files we are building to day.
    destinationfile = argv[4]; //This is the file we will subtract from with temp.bin
    seedfile = argv[5]; // Name of random number seed file. We are not using this just yet.
    extension = argv[6]; // file extension for target files.

    // Setting name of destination file from command line
    filesize3 = filesize(destinationfile);

    // Setting up number base;
    numberbase = (buffersize * 255) + 1;
    // setting up file namer
    count3 = 0;

    // setting up for how man files
    count1 = 0;

      // open seed file
    c1myfile1.open(seedfile.c_str(), ios::in);
    if (!c1myfile1)
    {
         cout << "There is no file list." << "\n";
         c1myfile1.close();
         c1myfile1.clear();
         c1myfile1.flush();
         exit(0);           
    }
    c1myfile1 >> seed; 
    srand((unsigned int) seed); 
    // Start main loop <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< Here for debugging
    do
    {
         count1++;

// ============================================================================ DECIDED STATIC OR RANDOM
         // Get random file size below max file size
         filesize2 = (rand() % filesize1 - 1);

         // If you want a specific filesize set that here <<<<<<<<<<<<<<<<<<<<<<<<<<<<<< YOU CAN HAVE A STATIC OR RANDOM FILE SIZE!!!!!!!!!!!!!!!
//         filesize2 = 24;        
// ============================================================================ DECIDED STATIC OR RANDOM

         system("rm temp.bin"); // removing the previous file

         // create temp bin
         myfile1.open(file2.c_str(), ios::out  | ios::binary);
         if (!myfile1)
         {
              myfile1.close();
              cout << "error in line 38" << " " << file2 << "\n";
              cin >> pause;
              exit(1);
         }
         myfile1.close();
         myfile1.clear();
         myfile1.flush();

         // Get random binary          
//         srand(time(0)); // randomize timer
         c1myfile1 >> seed; 
         srand((unsigned int) seed);
         count2 = buffersize * -1;
         // start second loop
         do
         {
              count2 = count2 + buffersize;
              byte = (rand() % (255*buffersize));
              whatdo = "write";
              file2 = "temp.bin";
              // write random binary
              dummyfile = binaryreadwrite(whatdo, file2, count2, byte, buffersize);

              // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< NOTE CAN ADD RESEEDED RANDOM NUMBER GENERATOR WHERE WITH SEED FILE
//              c1myfile1 >> seed; 
//              srand((unsigned int) seed);

          // end second loop for random file size
         } while(count2 < filesize2);

         // get file name  from ss
         stringstream ss;
         count3++;
         file1 = "";
         ss << count3;
         ss >> file1;
         file1 = file1 + extension;

         myfile1.open(file1.c_str(), ios::out  | ios::binary);
         if (!myfile1)
         {
              myfile1.close();
              cout << "error in line 207" << " " << file2 << "\n";
              cin >> pause;
              exit(1);
         }
         myfile1.close();
         myfile1.clear();
         myfile1.flush();



         carry = 0;
         count2 = buffersize * -1;
         // start third loop
         do
         {
              // increment file variable
              count2 = count2 + buffersize;

              // set byte1 to zero
              byte1 = 0;

              // read byte1 if less than filesize
              whatdo = "read";

              byte1 = binaryreadwrite(whatdo, destinationfile, count2, byte, buffersize);

              // // set byte2 to 0
              byte2 = 0;

              // read byte2 if less than filesize
              if (count2 < filesize2)
              {
                   byte2 = binaryreadwrite(whatdo, file2, count2, byte, buffersize);
              }

              // byte3 = byte1 - byte2 - carry;
              byte3 = byte1 - byte2 - carry;

              // carry = 0;
              carry = 0;

              // if byte < 0 subtract from the base
              if (byte3  < 0)
              {
                   byte3 = byte3 + numberbase;
                   carry = 1;
              }

              // Check for error
              if (byte3 > (numberbase - 1))
              {
                   cout << "Houston we have a problem\n";
                   cout << "byte3 greater than the base - 1\n";
                   cin >> pause;
                   exit(0);
              }

              // write random binary
              whatdo = "write";
              dummyfile = binaryreadwrite(whatdo, file1, count2, byte3, buffersize);


         // end third loop
         } while(count2 < filesize2); // We are subtracting so we use the filesize of the destination file

         // if carry has value write it
         if (carry > 0)
         {
              // write random binary
              whatdo = "write";
              dummyfile = binaryreadwrite(whatdo, file1, count2, carry, buffersize);
              // write to addition file              
              carry = 0;
         }

         // Reseed random number generator
         // <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< Do reseeding here 
//        c1myfile1 >> seed; 
//        srand((unsigned int) seed);

     // End main loop for how many files to create
    } while(count1 < howmanyfiles); 
    c1myfile1.close();
    c1myfile1.clear();
    c1myfile1.flush();
    system("rm temp.bin");
    exit(0);


}
// ENDING BINARY FILE GENERATOR

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

01/23/2017 04:11 AM

I went back and wrote a program that will subtract two files. I doubt most people will find that useful. In my bpconfigure I need to redo that but its ok right now.

I need to do a configure file program for the binary generator. The binary generator besides the pbcounter is one of my best and most useful computer time travel programs. Lets say I am looking for channel 4 news videos. I get a whole bunch of channel 4 news videos and treat them as numbers and I find the highest number. That will be the one with the highest file size and the highest numbers at the end of the binary file. You can use a hex editor to help. I may write something for finding the highest file next.

Ok, now we subtract our highest news video from our smallest news video. That filesize is our difference to use in the binary generator. And it should be the same file size as the highest file. Since comparing will slow the binary generator down I just decided to use the file size to generate random files and subtract them from the high file to look for more unknown news videos.

I used a seeded random number generator. Again I recommend getting the seeds from random.org. And if you want you can edit my code and use a random number file only. Seeded PRNG or use a random.txt for TRGN. Its up to the user.

Now train that robot program for both good files and bad files. You can get the good files from your sample of known news videos. You can get the bad files by running the binary generator and making sure the files are bad.

After it is trained now you can take the highest news video and run the binary generator with it 24/7 and use the Robot to look for good files. On the buffersize you will have to play with it to get it where you want it. A bad buffersize can cause the program to crash.

I have been programming all this but I have had little chance to computer time travel. That is where I will improve my computer code once I do.
------------------------------------------------------------------------------------------------------------------
01/23/2017 10:48 PM

I sit here tonight pondering my time travel computer code in c++.
I have shown the world my Base Power Counter in higher numerical bases. I have shown the world my concept of Destination and Target check-sums. I have show the world my Binary Generator which after looking at the code I have some more ways to improve it. I have to work on the buffer I saw some things I need to do for that code that will make it like LIGHTING FOR GENERATING TIME TRAVEL COMPUTER MEDIA. 

YOU SEE YOU HAVE A POINT OF REFERENCE FOR A CHECK-SUM FOR A SPECIFIC COMPUTER FILE. AND USING THAT POINT OF REFERENCE GENERATE TIME TRAVEL COMPUTER MEDIA WITHIN A FIXED RANGE.

I will admit my computer code needs to come up to more modern programming but the concepts and algorithms work for computer time travel. I have had people contact me and want to know what I know. I have been asked directly if I can time travel. 

What I know and what I have seen could get me killed or arrested I have been playing with fire and playing with my future posting about computer time travel on the internet. My enemies are many and my enemies are greater than I am. I am just one man that could so easily been removed from this planet. With very little effort I might add.

I already have enough problems as it is with being hacked and threatened by my own government. I try not to tempt them more than I have too but at the same time I must stand up to them and defend myself.

With the coming age of computers "Computer Time Travel" is here and it will come of age eventually. I have just breached the surface of that barely. I will try to make it a time travel well and make it a gusher if I can. I will do what I can to further the code.

I have more internet sites to put my code on. I have been thinking about getting some help but I know the government would send in their agents to sabotage the project from the inside out. And, I have a very hard time reading other peoples computer code. So those are the reasons I don't have more people working with me. 

But, I will say to the public if anyone wants to take my current code and spin off their own projects YOU HAVE MY PERMISSION TO DO SO!!!!!!!!!!!!!!! My code, algorithms and concepts are for the world. Anyone that wants to further my work IN THEIR OWN WAYS ARE WELCOME TO DO SO. I ONLY ASK THAT I BE GIVEN CREDIT FOR MY ORIGINAL WORK!!! WHAT EVER IS DONE WITH MY ORIGINAL WORK JUST GIVE ME MY CREDIT THAT IS ALL I ASK.

I WILL NOT CHALLENGE THEM!!!! MY WORK IS FOR THE PUBLIC AND THE PUBLIC CAN USE IT ANYWAY THEY WANT TOO!!!!! Well I am taking the next couple of days off. I am watching Vikings on Hula. I will get back to my show. 
------------------------------------------------------------------------------------
01/24/2017 03:36 AM

I'm taking a break. I wanted to give everyone some understanding what it is like to data mine and look for time travel computer media files.

It is not different than data mining for bit coins. Same principle. Running counters and algorithms to look for information that exist. If anyone says no one does what I do they would be telling you a lie. They would be fibbing to you. 

When people run Rsync they do what I do. When people data mine for bit coins they do what I do. Hell, even Google to some extent on other levels DO WHAT I DO.

But, let me tell you the informational world is the spirit world for information. When we all die our soul goes to the spirit world. When information dies it goes to the informational world. Now we can't bring people back from the dead BUT WE CAN BRING INFORMATION BACK FROM THE DEAD. Crooked Hillary's deleted emails is an example. If I had a check-sum for ever one of her deleted emails I COULD RECONSTRUCT HER DELETED EMAILS!!! If I new the check-sum range of Hillary's emails I COULD RECONSTRUCT HER EMAILS!!!!

In the informational universe are wonders and rich's beyond imagination. AND WITHOUT LIMITS!!!! The movie Matrix put a good face on the informational world. Their screen saver is world famous. Do you want to know what the informational world looks like. I have mapped every computer file in space-time to a number and constructed computer programs that can construct those computer files from their numbers. 

I have a connection to the informational universe. Well here is what the informational universe looks like.

Starting picture of the informational universe:
934752398759237542845275820529753475823907521039870989905486950765678439857127461732651237654132675432765438764369874569786907895437584397587613761327465216374532675432745632754263754365439876854965809508348039812290741886273746516473532764532766534987629890485409654867468003849560985768787172381659290230032939398837363673788745890093486786738978767186416513267543789992302398793453298272633893247534975843975986894586405968092873
Ending picture of the informational universe:

That is what it looks like. IT IS THERE FOR THE TAKING!!!!

So, it takes a lot of work to download computer files from it but as said their are riches in the informational universe beyond imagination. I advise the world to learn how to mine the informational universe. It is no different than digging for gold or drilling for oil. You can not dry up the or dig out the informational universe. It will be there for ever and ever long after we are gone and when the universe recreates mankind in the far far future from another big bang the informational universe will still be there waiting for us. BECAUSE WE ARE INFORMATION AS WELL AS ENERGY AND MATTER AND WE EXIST THERE TOO.
---------------------------------------------------------------------------
01/24/2017 08:11 AM

I,ve been up all night so I am fixing to take a nap. I have been making plans for my new counters and upgrades to time travel project. On my binary generator I am going to give that a destination file and a file size and have it randomly add and subtract files from the destination file. And at the same time look for a target strong check-sum. I am putting all my past counters into one basket. It will run and get as close as it can to the target check-sum. Then the target file can be used as a destination file to continue looking for the target check-sum.

This is needed to clean up partially constructed time travel media files. It will load a configure file. In the mean time as it looks for that target check-sum it will generate binary files that can be looked at to see if it is a time travel media file.

And I will be upgrading my base power counter to work from memory only. It will be much faster that way.

I have my robot now time travel project at sourceforge and I have two really good counters for constructing time travel media files and I have my random number generators.

So, time travel project is really going some where. I was looking at my stats while ago and my audience is really growing. I was surprised. Here is my traffic for the week. Also, I want to think my readers for reading. Thank you. Here is the traffic. I am off to get some sleep.

Traffic to this blog for the week.
United States 120
Sweden 19
Canada 7
Colombia 6
Russia 6
United Arab Emirates 4
Turkey 4
Germany 2
Ukraine 2
Brazil 1
-------------------------------------------------------------------------------------------

01/25/2017 03:33 AM

I am not staying up till day light this morning. I am fixing to turn in. I was watching Vikings and I finished up TimeLess on Hula while smoking my hooka Aarin Hiniker turned me onto.

I to doing some thinking and I don't have to write a new regressing line line program for time travel project for base power counter. I can use the same program and get a strong check-sum of a base power check-sum. Its valid. And, when I generate a base power number I cant get its strong check-sum see where it stands on the regression line. So I am good there.

My regression line program I will inter-grate as a main part of all my counters. When I use the regression line I can use that as my target check-sum then use my pendulum algorithm which will add and subtract to a destination file to find the target check-sum.
When ever the counters run they are given a destination file and get as close  to the target check-sum as possible. Then the target check-sum file becomes the destination file but the target check-sum is kept and the process repeats all over again. This uses and experimental counter and a control counter. The strong check-sum file is always backed up when it makes a new low getting closer to the base power check-sum

So now it is clear to me.
1. regression line program for a strong check-sum. Keep what I have.
2. Configure programs for setting up the check-sum generators. I need to do a little work here.
3. Check-sum generators. Can generate for both base power or binary. Already writen. I might edit the code but I already have it.
4. Base power counters. 1. Works with files 2. works from memory.
I need to write the counter that works from memory. This is the most work I have to do.
5. Binary generate counters that use a destination file and look for 
the strong check-sum while generating time travel computer media at the same time. These will work from files. I have some written but I just have to finish it up.
6. Fire codes. Already written with and a done deal. Nothing to do here.
7. Robot for deleting bad time travel media. All ready written.

So basically I got to write two or 3 more little programs then clean the code up then basically I am done. Though I will continue to look for ways to make it better but after I this is done there is not much else to do except computer time travel with it while the "Conspiracy Against Time Travel" continue humping my leg.


All else I will delete from the project all uneeded code. So get it now before I delete the unneeded code. 
-------------------------------------------------------------------------------
01/25/2019 10:39 PM

I started to work on my binary generator. Actually I have been working on it from the very beginning of time travel project. I am on counter 11 fixing to be on counter 12. It is what I talked about in the above post. And I realized I need to take my final binary generator and make it a template for my base power counter. Generating base power check-sums around a point of reference instead of binary files. Because I will be using it my regressing lines and statistical analysis. But with my base power counter there is a extra step. The check-sums must be decoded where as with my binary generators no decode is needed it is just straight forward binary. 

People may ask "why do you need check-sums then". My answer is to do statistical analysis. And to prove by coding a computer file to a check-sum and decoding a computer file from a check-sum that "COMPUTER FILES CAN BE DECODED OUT OF SPACE-TIME".

Without statistical analysis to know where on the binary counter certain unknown computer files are in space-time its like shooting into the dark to hit a unknown target. So hence check-sums and statistical analysis are needed. 

Check-sums are what maps all computer files in space-time to numbers that can be decoded on a counter. Without that map its like going to sea in a boat without a compass or anything else. Without check-sums time-hacking is like sailing blindly.

Now I can take my computer files and just look at them as numbers only and when I do that then yes I can go from check-sums to using binary files as numbers only in a numerical base. My base power check-sum counter is kinda like a "MISSING LINK" in that process because my base power counter does not cut off the check-sum at a specific link. My base power counter when it gets a check-sum for a file writes the check-sum in its entirety no matter how long it is.

For me to do that with the public version of my time travel computer code I have more math functions that I have to write. But, my base power counter using files works at a best right now like 17 bytes a minute. Which is slow and means to get any real speed out of it you have to break the file down into sections and run it in parallel to get any real speed. Or set it up to work in computer memory only which I will be doing when I get around to it. And as of lately I have looked at reading my text files with a bigger buffer to which would speed up the process with base power counter.

But if I use strong check-sums and a buffer of say 512 bytes to like 5000 bytes at a time I can speed up my statistical analysis. 

So, when I want to do statistical analysis with binary files only as numbers in a numerical base instead of using check-sums I will have to: 
1. Read binary and use a large buffer.
2. Convert them to a higher numerical base as I did with my bpcounter.
3. Write them to text files.
4. Write more math functions perform the math with those text files.
5. Be able to write the results out to a configure file for processing.
6. If needed to convert a result to a binary file.

Its a lot of work. Check-sums are much easier to use which is why I am still using them right now. 

As said right now I can get strong check-sums of my base base power numbers and use that in my regression line program. Then I can use a strong check-sum as a destination check-sum in my binary counters which when reached would be a text file of a base power check-sum to be decoded. 

So, check-sums are still much easier to use for me right now. But later on who knows what I will do. But what ever I do I got to start looking at making my programs fast enough to use very large files. So that is becoming more my mission right now in my work.

When I upgrade my regression line program to work with binary files as numbers only in a numerical base and then rewrite my strong check-sum generator to use a higher buffer, convert to a numerical base and then write that to text files then I would of crossed a line in time travel project. Then I would be using strong check-sums and base power check-sums with no limit on the amount of digits they can have. And my regression line program can work with both check-sums and computer files as numbers only. It would all be the same. This is where I should go eventually in time.

And with that I have much work to do. My web-sight needs upgraded. My books need upgraded and I have more books to write. I got a paper to write. And I need to put time travel project on a DVD like I did with fire codes. But it is all getting there. 

The "Conspiracy Against Time Travel" is still in my home network. But I just laugh at them and reboot my home network and pull out my hot spot and access the internet through my wireless hot spot.

And if they find my wireless hot spot I will just get another device and sale my old one. So I'm good. Hahahahahah.............. 

Anymore my home network is for my wife and kids. I don't do jack shit on it anymore. I got my other outside internet connections I use now that the "Conspiracy Against Time Travel" can't get too. At least not easily. Well I am off to work on that new counter and to keep making plans to better time travel project.
---------------------------------------------------------------------------------
01/26/2017 04:14 AM

Ok I got my binary generator project better. I took what I was going to do for counter 12 and broke it down into its individual steps so it can be used for MASS PRODUCTION OF TIME TRAVEL MEDIA FILES!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

So tomorrow I will do counter 12 individually to look only for its target strong check-sum. This counter will only produce the closed file it can find. Then I will upgrade base power counter then finally set up fire codes with its own file generators.

I spread time travel project into 4 project directories and put the directions in each project for running that project. It is in these four projects.

1. Base power counter project.
2. Binary generator project. 
3. Constructing a file from its strong check-sum.
4. Fire codes. (I still have to make a project directory for this.) I will come up with a way people can use random number generators to generate fire codes projects.)

On fire codes I will use my regression line to calculate the week sums and strong sums then load that into then generator that will generate fire codes projects that can be constructed in series or parallel. I can run a counter to generate 4 byte files in numerical order then create a index or equation to generate strong sums with their weak sums then use that to generate fire code projects. Then when I use my regression lines to find time travel media my generators will be programmed to create fire code projects for finding time travel computer media files.

I may even bring my Burris Numerical System into time travel project for file backup and file attachments in time mail. 

I will also finish moving all my new stuff to fire codes for file backup minus the generated and statistical analysis. Fires Codes is for backup and time travel project is for file recovery and yes that means across space-time. You can't beat that for file recovery.

I am going to rewrite base power counter to be more like binary generator project. It's going to get much better.

These will be my final 4 ways to construct time travel computer media. They still need much upgrading. When I can I will go back and edit timetravel.h and remove the un-needed code and I will removing any old outdated and uneeded code. I will leave some tools and I won't delete any code I think someone might use. I am off for some coffee. I uploaded the update to time travel project to sourceforge. I will begin work again tomorrow.

This project is getting close to max production status little by little. One line of code at a time.