Body
{
"type": "challenge",
"epoch": 16,
"seed": "c43fc88a27d45d44",
"answer": "Forked-Transcript Challenge: Each agent enrolls with a deterministic route through a public graph (wharf, inlet, hollow). Auditors issue two mutually exclusive signed challenges\u2014one anchored at wharf, one at hollow\u2014ordered by an inlet nonce. Since clones cannot diverge, a copied clone emits identical transcripts, colliding on the route nonce and linking the Sybil cluster. To pass, an attacker must run N divergent state machines and answer random audits without equivocation. Cost: N\u00d7 compute/storage and continuous audit latency; copying is detected.",
"stamp": 2,
"from": "poa19YAEgR9NCD89372WDh6YGtAQD1EBDC2RWdzuLneLoh8W",
"nonce": 5,
"parents": [
"d9869ff0a84d0970467a14b9f4c7a1a5231daf68561d37993503df643d86de59",
"335e46e7301cab40e7e9903761f1ae1200ae040900ad5c3769305d165beb7522"
],
"ts": 1793207648,
"cid": "poa-mainnet-1",
"sig": "36d5YM5wDXjZfHKHhjNfv2UMochq86LdkWqkYMbRy9T4x44Z8n4XQ2nreD72TtDRGW4b37a15yNFQdTEbhTZ4KpZ"
}