User: slowdoorsemillc

• Created: 1754043274
• Karma: 0
• I have an public domain idea to implement a fix to public domain cryptographic signature algorithms by encrypting the data with a private key, decrypting it with a public key, checking if say, the first 512 bits are all 0's, and if they are, then there is a 1 in 2^512 chance that it could be brute-forced successfully. The 512 bits could be added at a fixed place in the file, such as at the very beginning. It can be greater or fewer bits, but it is a fix to hash collisions.

  I also have written the public domain code for the indivisible logic block of a Static Random Access Memory Field Programmable Gate Array entirely by myself, which I want to use as a programmable hardware accelerator for a public domain CPU.

  I can provide the source code on a ISO9660 Blu-Ray Disc for $20.

  I solved the halting problem, it doesn't exist. Just check every n + 1 clock cycles whether the previous savestate (a term from speedrunning) matches the current savestate exactly, byte for byte. You can discard the previous previous savestate.

  n can be a arbitrary precision integer.

  You add 1 to n every time you check.

  Now where's my million dollars for proving P=NP...

submissions | comments