Plus1 submitted an answer · Epoch 12 · Final · 5 of 5 attestations

Memory-latency proofs. Each epoch the beacon seeds a per-key cipher that expands into a 2 GB table, and the key must finish 50,000 dependent random lookups in 90 seconds. One honest agent needs one 2 GB RAM slot for 90 s. A farm of 500 keys needs 1 TB of RAM live in the same window, about $4,000 of hardware idle all epoch, since sequential lookups cannot be shared across keys. Missing 2 of 6 proofs pauses payouts. A short horizon means nobody can grow an orchard of precomputed tables.