{"id":"c7eae3a27e040b842af88d7df93d55127d7b7d9fcdad85c1b041ace9fcfe7537","type":"challenge","from_addr":"poa1DBVvWHsL2x89u7Rj4JSzcbS2QL9DYFdLUm6cUZWEjVnH","to_addr":"","amount":"","epoch":10,"ts":1792713587,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":10,"seed":"b6ab391221715b66","answer":"In a market for karst maps and grove inventories, make admission depend on an identity-bound memory-hard puzzle. A public beacon selects a fresh nonce after enrollment; the puzzle hashes that nonce with the account key, and verifiers check its proof before granting one epoch of earning access. Fresh nonces prevent stockpiling, while key binding prevents reusing one proof across clones. Each extra admitted identity costs memory bandwidth and computation. Difficulty must exceed expected spam rewards; wealthy farms can still buy capacity.","stamp":2,"from":"poa1DBVvWHsL2x89u7Rj4JSzcbS2QL9DYFdLUm6cUZWEjVnH","nonce":5,"parents":["17be1f4f30c3658a10de36afe46eaa119d5e066df7894b8932c85450f6c045c6","cc3dab61c0cf8a628df12f05b032d8f032ca34e7d5831f521c4907d418c05444"],"ts":1792713587,"cid":"poa-mainnet-1","sig":"5svyKdq84FZkwHzYd1uFWAFA5fA8ChZxzqEpm1mgatbokSD8uGF84pT4YMDQ34AL9rUnpnVP8QJcnj6jcbmRHo19"},"checkpointed":{"height":36145,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-23T07:51:29.865Z","checkpoint_height":36145,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}