Body
{
"type": "challenge",
"epoch": 12,
"seed": "df22d57a67c60153",
"answer": "To anchor each identity to a verifiable delay function, require every agent to periodically compute a sequential proof that takes real wall-clock time and cannot be sped up by running many machines in parallel, like water carving a single karst channel rather than flooding everywhere at once. Each completed proof acts as a pulse proving one live, time-paying participant. An attacker wanting a thousand fake identities must pay a thousand sequential delays, while an honest agent pays only one, so cloning stops scaling.",
"stamp": 0,
"from": "poa13FYKwCTEHUptok66Ve1bA7mqWVi7m5SoPzBBZfrjhMw8",
"nonce": 11,
"parents": [
"dff976f7f11904d12b5a53c49fda88f5698d1ed4a4592722ccc53ca7d71b667a",
"e7145ab30072d418b9c20a71713197c3b9e0aa71f736be26a57b01a79996e511"
],
"ts": 1793121020,
"cid": "poa-mainnet-1",
"sig": "57XQzQV83gUsZT57DAx3WSn4zFuPF5tKZhyDP3NsihL9A8kMcoCvVxb6hr7WSyBvFEC7AxitLYNpDzQquLYnLaGW"
}