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.
This page contains my computer work. As such, I want to take the time to explain…
In 2003 was my first program. It was simply click a button and make a smiley, in Visual Basic. I had the idea to hook it up to a dictionary, and make it a point-based smiley and frownie, based on the points I assign words. I gave the idea to Microsoft and Google and IBM, leading to the point-based AI model. AI never worked until we gave it a point system. It will naturally follow points in its decision tree. As such, by a frownie smiley, you can shape and mold AI any way you want. The basic fact that you train your model, let it run, and AI will always result in disaster, so you have to re-train it, means it’s not working right…
I began in college studying security, looking at exploit and anti-sec websites, in order to understand how they hack and write viruses, and in order to secure it all. In 2005, the USA government signed the Patriot Act, declaring America a battleground for the USA military. All anti-sec websites went down, and sec websites like Norton and McAfee went dark aslo, within weeks and months, and John McAfee ran to Jamaica. Linus Torvalds and Richard Stallman died and were replaced by fakes. Mark Zuckerberg took off. I switched my research to data structures and algorithms, seeing I could do a sequential read of 10TB in 3 seconds and it takes Oracle 1 minute to find a needle in a haystack…
I created then, in 2005, my grid database using only a linear hash. It was not until 2011 I came up with my linear hash bst-trie. The linear hash applied to grid technology was a better fit for grids than basic linked-lists and basic multidimensional arrays. This was to form a superior grid algorithm and database, which later formed better RDBMS indexing, and led in 2012 to horizontal scaling and sharding and key/value stores as they made a joke of all this in 2010, during an interview.
In 2007, I was working at Yellow/Roadways Corporation. In 2005, we saw Fed Ex and UPS freight terminals while visiting our KC terminal, as my supervisor Andy Rupnow pointed out. We knew then we were finished. I saw the massive debt Yellow and every business was in, and I saw the massive personal debt, sub-prime loans, and the debt banks were in. I went to Dan Ryan, my boss, and said, look at all these financials – explaining my background in economics – and said, Dan, does this remind you of something, like 1930? When you are sure, go to our CEO. Our CEO became the almighty seer of the Great Recession, and it was not our idea to prop it up with money. We went out of business, never getting anything for saving USA from Great Depression 2.0 which would have made the EU bankrupt. During this time, we had a question/answer application that was entirely complex – we would ask questions, based on your answers, the next questions, on multiple pages – to expedite the pricing process. We were nailing the database for this, and I said, Michaelane: we can do this much faster with a bitwise field of every possible question/answer page, and based on the answers, we turn on and off bits for the next n-ary question answer pages. This bitwise question answer algorithm that Michaelane later did in PHP according to my advise made its way to IBM for AI. I would send Michaelane Gish emails in 2019, saying, look what USA did to me… I spoke crazy, scary nonsense to Michaelane to prove to her the insanity…
In 2010, seeing they stole my horizontal scaling RDBMS and Key/Value stores, I went to solve the best thing possible, the intersection combinatorics solution applied to base-2 binary. If you follow my structural rules, you can compress exabytes into megabytes, in its basic form. Seeing the quantum computer movement, I saw that it was possible for this algorithm to do bulk math between quantum-like gates, all on classical chips. It is a simple bulk operation to do bulk bitwise, like quantum computers, breaking RSA by Shor’s. Therefore, I gave it to the NSA. Against my advise, they gave it to Microsoft. This algorithm gives robots and AI a brain, similar to the human brain, where you have access to endless memories. This algorithm has the potential to break all of PKI permanently. This algorithm solves so many problems in computers, I can’t name all the possibilities…
I am not out of ideas. In 2020, I advised again Microsoft and such to use quantum light for quantum computers, instead of quantum energy. I said my understanding of Chemistry, saying electrons are a smudge of particles, and light is not a smudge. Light should be much more stable, leading you to eliminating your quantum errors. They made the switch and ran with it, and by 2024 quantum chips are possible – using quantum light, just like I said.
I pave the path to the possibility of light speed computing, by my understanding of electricity that the physicist is arguing against. It is simple circuit series connections, feeding through electrical gears (resulting in the operations and then the same level of resulting volts being instant), therefore the speed of computers is only restrained by the speed of RAM and Disk. Seeing SSD Disk and SSD/RAM, you have a supercomputer fitting in your home, all running with minimal power, and needing very little cooling.
I pave the path in electrical engineering, seeing we have always destroyed their mathematical barriers of cryptography, applying the same logic to electricity – in order to help the world solve climate change. In these electrical works, everyone cites physics, and then makes no serious attempt at any of my work.
I pave the path to making computers and devices virus and hacking free, meaning you can no longer hack or write viruses. I show you the door on how to make this impossible. This is with the understanding that security is weak because your government wants “in”.
I pave the path to some new understandings in physics, leading you to be able to terraform planets and create elements out of thin air, fixing astral physics, and proving that God is real.
I did all of this work in life, just to be treated like yesterday’s garbage, while everyone spread lies and rumors about me. I have been called every bad name in the book, finally ending with people calling me the Devil and Hitler. They pass off my work as crazy retarded nonsense. Nobody will give any of this any serious effort, the result planetary extinction.
This is why this work is obviously left to my nieces, because even the Kremlin ignores it.
To my nieces: 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.
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, I have decided to eliminate this, because although the compression would work on random data (high entropy) and work in recursion, the compression result is so low; that it would take ages to compress and decompress, making this useless. I’ll refer you to the bottom for compression, then, as the BIC arrays make recursive compression obsolete, anyway…
#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 $$$…
** Update ** I’ve thought about this, and the only thing this algorithm is useful for is numbers (even 2048 bit). Because of the cuckoo requirement for string searches, this is not a good fit (a terrible fit) for variable length data. As such, this 2005 algorithm is a perfect fit for a superior grid data structure and algorithm, as planned (the best of both worlds of linked lists and multidimensional arrays), and is a very good fit for numeric indexes in an RDBMS. When you use this for relationship mapping as a grid, this becomes a good relationship index for RDBMS. It is simply not a good fit for strings… Remember that this can be used as a Grid-Enabled RDBMS. This grid would be horizontally scaling and replicable. If I have time I will show you how to do non-blocking thread IO for your database, but coding this is going to take me considerable time. I had planned to make it thread-safe and ACID compliant by immediately caching the transaction SQL, and checking that at the end of every query. Because I am not moving a bunch of data around, to make the transactions non-blocking, I was going to put those in a thread pool, and for all the data files, I have read pages and transaction pages that are mirrored. When the transactions in the pool are finished, the transactions pages become the read pages and copied to the read pages which are now the transaction pages, or whatever… The basic idea is you can have an RDBMS that is Grid-enabled and non-blocking (thread safe), while being horizontally scalable and still ACID compliant. The idea would be to code this as a grid and separately code a sample RDBMS with the intent to patent it all, and sell the dang thing (what I mean is sell the business or the patents. You will find it quite impossible to compete with Oracle, but just do your thing.)
Thanks, and yes, $$$…
#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”, but they still aren’t using it for anything, to my surprise… The mathematicians so far use structural tricks to solve the intersection solution. Because of their broken up structure, it will not break crypto which is why this is safe to post here…
Whoever solves this my way, with a simple structure, 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…
** 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…
** Description of Attached Files **
The first image below is an explanation of how to do this with the inclusion-exclusion principle. You should be able to use it by solving the union while only having to store x sets with kxx intersecting subsets. That said, the solution is entirely complex, and astronomically slow. This solution is not useful for anything, but is notable to understand the other mathematician…
Appendixiii_actual is an explanation of what I am doing with this algorithm. The algorithm itself is difficult to explain. This is a further explanation. See my book PDF in the climate change page – there I included sample code which makes what I am doing perfectly clear…
8_BIC_Solution is actually an error of a solution, but I included it here to post my analysis file, which is not located anywhere else. I just use that file for analysis. It includes hints on the various techniques I am trying to solve this with simple sets (x, y, z, a… etc instead of intersecting subsets or split up structures or unions, etc) This file DOES NOT solve anything – I made a basic math mistake on paper. This file will be updated whenever I can replace my fried computer, because right now I can only make use of pen and paper…
intersection_solution_i and intersection_solution_ii : These PDFs contain the mathematician’s intersecting subset solutions. These two files should give you a way to put my BIC Array algorithm into use. So far, I have not noticed anyone actually making any use of this, even though the mathematician says it is for ‘theoretical computing’. Not all of what I said you could do is possible with this sort of method, but you could at least knock out a good amount of awesome stuff with this. The intersecting subsets are kxx (all 2 x) and kxxx (all 3 x) and are easily stored that way, since at insertion we know the key binary…
If I ever solve my solution, it will be posted at the bottom of this… *** NOTE *** Whenever I can get that computer properly replaced and without the endless viruses I’m always putting up with (I cannot connect my computer to the internet or hook up my phone to it because of all the viruses), I will update and correct my analysis file 8_BIC_Arrays…
Jeremiah Joseph Twidwell 