Prisoners of Work: Can Proof-of-Work Detect Quantum Computers?
Duration: NaN:NaN:NaN
Speaker: Aata Hokoridani
Type: Lightning Talk
Expertise: Deep prior knowledge
Event: Devcon
Date: Nov 2026
We do what we can. Consensus is hard. Machines do Hard Work, on Hard Computational problems to maintain it: consensus.
Can we break free of the shackles? let's unleash the chains: can PoWs act as honeypot-like detectors for certain types of computation? (eg Quantum Solvers)
What does a world like that look like? What computational class elegantly scales between quantum-easy and classically hard? Can we attract quantum solvers to the nectar, showing their hand in the process?--even ready to help us compute routines in The Big Computer.