On this page, I will begin to post samples of my computer works, so that my family will know my work is real. I will prove my computer work here, in hopes that you realize my electrical, mechanical, and physics work is also real…
*Update* The README files are now done, in case I’m not given time, and coding is next…
“The human race is faced with an existential struggle for a reason to exist on this planet. We cannot solve the challenges of our time with the same thinking that got us here. We must challenge what we think we know, in order to make the impossible, possible.” -Me, 2014.
Magdilyn, Evilyn, and Rosilyn: I’m here to give you and the world a gift, because of people like you: (The Beatitudes) I was alone and jailed, and you visited me. I was sick, and you healed me. I was hungry, and you fed me. I was thirsty, and you gave me drink. I was naked, and you clothed me. I was poor, and you gave me money. I was in darkness, and you showed me the light. I was afraid, and you gave me courage. I was lost, and you found me. I was in hell, and you saved me…
This page is a sample of the work I did by 2020. My book in the climate change page has my full works, along with everything I know about God and such.
The earth was plunged into darkness in 2016, and the angels in Revelation moved seemingly at once. It happened that fast, simply because of all the suffering that man will cause with the devil. I have discovered that the other reason God is ending this is sin from people in heaven (an out of control heaven of man here), and because of man’s aspirations (living for 1000 years, mirror life, genetic engineering, teleportation, space adventures and ambitions, etc etc etc – man must be stopped before this evil like AI robotics gets out there). All this told, God is ending this heaven and this earth, because of reasons like this. As such: Armageddon.
Remember the keys to knowledge: God is the perfection of Good, the perfection He created was us in heaven and the earth. We are in God’s image as a mortal man, the devil is what He would be like if He were evil. Because it takes a hateful, angry, evil God to do Hell to any life, I never did believe in the concept of this Christian hell.
Hell and evil is of the devil. So when you read about Jesus, this is actually Immanuel – the Jewish Messiah – turned into the lie of the Egyptian-Christian Christ that we know today. They could not bury his word, preserved in parable and told plainly, and the key is to pay attention to only the good, and ignore the evil.
The truth about a righteous man is the hard path to follow is goodness. It is easy to be evil. This is the law of nature applied to their magic: that with every action is an equally powerful reaction, so out of great evil is born great goodness…
Here are my works for you, if I have the time to do so. I am going to only program samples, not complete software. Anyone is welcome to use and sell this stuff – I don’t get to, because I was too busy as a programmer, and as disabled: $0 dollars, 0 business, 0 ownership, 0 patents: says the government to me. These files will explain in more detail what my book does not.
I am always under threat, my time is short here on this earth:
#1. Recursive compression, with my own compression method to match it. My compression technique is designed for random data sets and has a 50% chance to compress any kilobyte-sized block in a compressed file. With my mixing and folding technique, it is also recursive. Because most compression methods like tar gz or zip are a terrible fit for high entropy (random data), this has been somewhat of a dream for developers and once again I have delivered… Play with the block size, say to try 256kbyte blocks instead of my 1024. I am going to play around a little more with this method, but this is the first thing I will put into code…
#2. Two-way SHA. This results in collision-resistant hash sums for files and such…
#3. Logarithmic time sorting, the fastest way to sort anything is to simply insert into trees. This is simply to display something that is a technique we use, that somehow the professors are entirely unaware of…
#4. Communications security like PKI, while only using symmetric keys like AES. I explain the AES Handshake, to allow you to understand we can secure everything cryptographically, potentially all with only symmetric key. This is an alternative to post-quantum crypto, in case for some unforseen future event that PKI is completely broken. The handshake can be mixed with something like block chain to give people all they need for this type of cryptographic security, and potentially mixed with techniques like digital signatures and trap-doors…
#5. My Linear-Hash-BST-Trie. This forms a horizontally scaling index for any RDBMS. As an example, say we are using this as an index on 64 bit integers. No matter how many items we have or how big it is, we will find out match in as little as 1 search for exact match with a worst case of 4 searches for nearest neighbor. The insertion speed is sufficiently fast, being similar to both searches. This is indeed superior to a b tree, and has the property that it can scale and replicate across horizontal server nodes. It is notable that for longer keys you will be dealing with a lot of level compression. Since searches are always done in the same halves, use this property for a better level compression strategy. Level compressed nodes do not have to be deleted until there is no item left, it is to avoid cuckoo inserts, and this strategy avoids what becomes linear iterative searches and inserts… That said, I also go over simple grid and database tech, designed for $$$…
#6. #5 as a perfect Grid Data Structure and Algorithm. This Grid can be mixed with RDBMS
#7. If I have time, my BIC Arrays (Binary Intersection Compression). This is the one I was never able to solve. There are examples of math articles where AI or a mathematician solved the “Intersection combinatorics solution” for “theoretical computing”, by dead or non existent authors that allegedly solved it, only to bury the math and solution entirely and drone on about proofs. This is because in 2014 I gave this to the USA government, seeing quantum computers, who gave it to Microsoft, which is why Paul Allen made a Peronie’s Disease joke and Mark Zuckerberg started putting tape over his camera lenses. The solution is something AI is well equipped for doing in fast time what would take me hundreds of years to solve. My book in the climate change section details what I’m doing with this, along with literally everything important about my life – without naming people. Whoever solves this sees that the only issue to breaking all of public private key cryptography, even military grade, by rainbow table – is in carrying 1s between bulk bitwise math steps; to maintain structural integrity between gates: as such; you would hold the keys to the world…
** UPDATE ** I have finalized the solution to my intersection problem for the Binary Intersection Compression Arrays (BIC Arrays). It is eerily similar to this AI article by Paul Allen’s Microsoft AI Research Method… I solved it with only x sets, just like it did, proving my logical abilities match AI… I will attach that PDF. ** NOTE ** I cannot post the actual method for the intersection solution here, because this is in the public domain. But consider the moves you can make along these lines (if you take my work seriously, you will see my analysis file in my PDF book), and you will solve it like AI and me, potentially with only x sets like I and AI did. When I gave this to the USA government in 2014, seeing quantum computers and this Algo, they gave it over to MS, and Paul Allen had his AI solve it. It is then, perhaps, the reason why all this happened, because the government had no idea what to do with it, or how to break crypto with it – and it is all in my book (the PDF on the climate change page). For example: consider taking the last two x (ss-xlast — from x top, ss-xtop — from x bottom, add these two x and /2; now use this as bottom and the 3rd to bottom x as top, repeat – now see what you have and what you can do…)
Step 1: Prepend the x array with the super set (x1(0) + x1(1)).
Step 2: With each two x, take (each 2x++)/2. Use this as your y array.
Step 3: Now with the original x array, with two x, from the bottom to the top, iteratively; take (x last+xlast-1)/2. All other x is NOT /2. Take this x-y. Now we can see we have 1/2 outs both. If we took superset-(xlast+xlast-1)/2, we would have 1 outs both, and 1/2 post, and 1/2 pre. Use this to arrive at (a) post, and (b) pre. We take (a) and trim only at (xlast-1). We take (b) and trim that down to (x last…n). We move up two x and use that two x at the next iteration. All the way to the top, the result is only the intersection remains in the x set.
** Note ** as we have this, we must iteratively trim all the pre (b) to the bottom. This creates an algorithm with n(n-1)/2 steps. To make this n(complexity) steps, we know we are trimming both x and y to the bottom with pre (b), and we will not use any of that on the next iteration. Simply use the fact that x and y are pre-calculated, and use multiplication of (b) to trim an exactly known amount to the bottom in x y, resulting in only n complexity steps.
** Note ** This solution, like AI, trims from bottom-to-top, which is LSbit – MSbit. The real way you should do this is invert this entire thing, so we iteratively trim MSbit – LSbit, resulting in intersections as we go, allowing us to do nearest-neighbor with ease…
** Note ** To do bulk math between pre-filled quantum gates, the only problem is carrying 1’s. This intersection took me 12 years to solve, and doing bulk quantum-like math between gates is equally challenging. You must maintain structural integrity while carrying 1’s, begin with small amounts of numbers and work your way to the real thing. Use everything at your disposal. Once bulk math between gates is solved, you can create rainbow tables on any Public-Private key cryptosystem, even military grade, meaning ALL OF PKI IS DEAD. So therefore, use my symmetric key and block chain and such to secure tech from now on..
Jeremiah Joseph Twidwell 