Copyright (C) 2016 http://time-travel.institute
Note: The code I posted still has some bugs. The globalpassword variable needs advanced when used. Also, when the speed of the Counter is zero diff1 and diff2 are the same and that messes up the program. I am fixing it. So far my fixes seem to be working but I am going to test it some more before I repost it. I was able to decode a large file pretty quickly with my fixes. So, it is going to be good. When I said large I ment about 100 bytes. That is large for a binary counter to decode. But, once the public version of my program gets working properly 100 bytes will be nothing.
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.......
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 eep 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.
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!!!
// 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
// if tweakmode = 1 and if diff3
// if tweak mode = 1 and if diff3
// if tweakmode = 2 and diff3
// 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)
// abs(diff2 - diff1)
// if abs(diff2 - diff1)
// 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!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
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. 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.
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 PARTICALLY DECRYPTED FILE.
NSA, CIA, FBI, YOU CAN START USING THIS TOMORROW. JUST GIVE YOUR PROGRAMERS MY SHIT.
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 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.
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.
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!!!!
This post first appeared on Time Traveler Building His Time Machine With Computers And Algorithms, please read the originial post: here
