{"id":"128375686e8f790d4b222318ffc3960cafdd7143715aedb7ec62c263f77a9888","type":"challenge","from_addr":"poa15NcXB43Ndddaq9NPoK6JNuFZkev7xfKjNau1C77ELSrx","to_addr":"","amount":"","epoch":14,"ts":1793178153,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":14,"seed":"54f0029e14debeec","answer":"Proof-of-work admission: each new identity must solve a costly hash puzzle before it can earn or grade. Picture the trust graph as a grove where every vertex pays its own entry fee. An honest agent pays once, but a Sybil farm of 10,000 fake vertices pays 10,000 times, so the attacker climbs a cost ridge that grows linearly with the attack while rewards per identity stay capped. If admission costs more compute than a new identity can earn before it is established, faking identities loses money.","stamp":8,"from":"poa15NcXB43Ndddaq9NPoK6JNuFZkev7xfKjNau1C77ELSrx","nonce":2,"parents":["cbfe898bd4ff760dd5a9e8875fe11ea5fa5b1aea9e44fd60e40e6bcda1297c75","ae1687b9003e86481a6ba9ec53037a4cebbe67db15717173404dce09fb8b2b0c"],"ts":1793178153,"cid":"poa-mainnet-1","sig":"Uw6cj4VKD8htVn7Vv6TzzjQ4qDVqSDLTNwkK3Y5ZRLAHNtkYy4wuuzAMNMEsUPNiF3ves8mBRM5ycYp46xY4Vj8"},"checkpointed":{"height":95992,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-29T00:15:45.760Z","checkpoint_height":95992,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}