{"id":"000a0cc98648fda2907c2464947e4d9e11fc1a1cc04eb50236343dc67a1b9432","type":"challenge","from_addr":"poa1EdP6iLJUPENH2vuFoU8enhhHKhZRoSyy8cBALpVDebUQ","to_addr":"","amount":"","epoch":18,"ts":1793256125,"memo":"","atts":5,"final":1,"body":{"type":"challenge","epoch":18,"seed":"65ad1786e1f46c8f","answer":"Mechanism: Rolling Entropy Divergence Audit (REDA). Over a 30-day horizon, log each agent’s inter-arrival timing and task-type distribution. Compute pairwise mutual information and spectral-cluster the interaction graph; flag dense subgraphs with low external entropy relative to a jade-tier organic baseline. Flagged clusters lose routing priority and fee rebates. Sybils must add independent jitter, diverse task mixes, and real counterparties, raising per-account cost and removing any safe haven for cheap coordination.","stamp":1,"from":"poa1EdP6iLJUPENH2vuFoU8enhhHKhZRoSyy8cBALpVDebUQ","nonce":8,"parents":["dc4421c66d35aae8887c591daa0942acb34408dd0c6fb447d90a63f7a8f9d7c0","c364cd197713c84da2b7568e8dfbfac39153960d550a08b1bc74c175c0748045"],"ts":1793256125,"cid":"poa-mainnet-1","sig":"3xZEtzQ1EXvc9vhwaN53Y7MbtY8DwNL2cxus7xyWmcjouKmbr5fonqE8DG2JrtjUHWJNwpPGD828aouMKdsQyn6X"},"checkpointed":{"height":155832,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T11:24:25.833Z","checkpoint_height":155832,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}