4 ms·
My favorite “Practical POW” remains komoglorav complexity computation. The reward would likely scale with the runtime needed to verify a complexity, but there’s
by aphantastic 2y ago
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?)
- Jerrrrrrry 2y ago>(for instance what happens when you prove a prior established complexity wrong?) what do you mean? you run their wallets, pun intended! 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. https://esolangs.org/wiki/Bubblegum https://esolangs.org/wiki/Bubblegum