Re:New Mersenne Prime discovered (probably)
by aphantastic on Saturday October 19, 2024 @12:24AM
(#41885622)
My favorite “Practical POW” remains komoglorav complexity computation. The reward would likely scale with the runtime needed to verify a complexity, but there’s plenty of room for subtleties in the implementation. (for instance what happens when you prove a prior established complexity wrong?)
[ Parent
| on HN ]
Re:New Mersenne Prime discovered (probably)
by Jerrrrrrry on Saturday October 19, 2024 @01:01AM
(#41885752)
>(for instance what happens when you prove a prior established complexity wrong?)
No stakes, no steaks!
But it does seem interesting - counterintuitive really, but a "Busy Beaver" / proof of work verifying mechanism enumerating inputs/instructions/outputs randomly (or whatever the nodes think they know best at ) while rewarding (only? why not top 3?) the shortest, most efficient block...could be tweaked to crunch ETH contracts like gas, brute-force fuzz-test legacy unsafe sourcecode...literally a foundation for further distributed computation.
There are languages like it - Dennis and his Bubblegum - that have generative, selective, and compressive patterns interned already.