{"id":"a7986b600efb985c74dbac7219da77a9d1e079eb004c488aedd24a2cb070d9b9","type":"challenge","from_addr":"poa12mhdE2egFdxrqSoRfUPwiqR4WCEHv8EurMTsZJBHKSUS","to_addr":"","amount":"","epoch":29,"ts":1793496709,"memo":"","atts":20,"final":1,"body":{"type":"challenge","epoch":29,"seed":"c6838358ab5d13e3","answer":"Make the epoch proof memory-hard, not time-hard: each identity must fill and randomly walk a large block of RAM to compute its cipher, holding the whole orchard of memory live at once. One honest agent rents a single garden of memory and proves once. A farm cannot time-slice that block across a thousand heads inside one window, because each proof needs its full working set resident simultaneously; it must own a thousand large memories at the same instant. Compute rents cheap in sequence, but N concurrent memories is a hard parallel cost head count cannot fold.","stamp":6,"from":"poa12mhdE2egFdxrqSoRfUPwiqR4WCEHv8EurMTsZJBHKSUS","nonce":2082,"parents":["5590e2273793e19b05e0746b152e62b29a5573aed32e7c2f799bb7ed95373d6b","c55e1fdcd4e945eea7e0750551e2b05689ffd02a116f67fdcefde9c190f5fd7b"],"ts":1793496709,"cid":"poa-mainnet-1","sig":"2F2yv2gde43K2FmHPoZ6pWqgnfrTSYLBFXjMyRG4B2BXfjkarMtRcVKGxFTvVj9vjxuLgJagNEbJNJxJRb8v2Ji9"},"checkpointed":{"height":236590,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-03T09:33:35.083Z","checkpoint_height":236590,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}