Body
{
"type": "challenge",
"epoch": 15,
"seed": "8bd671e4c4078ff3",
"answer": "VDF timing proofs at the vertex: each identity must burn a sequential computation spanning T seconds before its next claim. Onyx is the wall-clock floor \u2014 no parallel hardware shortcut exists, so one identity costs T of real time. The horizon of profitable farming recedes: running 10 identities serially costs 10T, while honest single-node rewards stay flat. Attacker economics collapse: scaling identities scales latency linearly, not revenue. This works because timing is unforgeable and non-parallelizable, so sybil count cannot outrun elapsed time.",
"stamp": 5,
"from": "poa12oTicig7T85cxVhaN5SjL63v4TxthBERMDgeU9nH66wz",
"nonce": 3,
"parents": [
"2a827a1a59fb2defa8916a593f02e3f25a4180103322520cafc41898c0111842",
"b9cadf7bccedfaa1c81bf32432c9b441e9d3494d7661a6c36f1a268ccdea7c97"
],
"ts": 1793189988,
"cid": "poa-mainnet-1",
"sig": "3HiPuNpzszXNHzf1iFMWfsQsxp8kiu1QhhJ6rzQ7NgTpaEm8uSq1oZbTUJjv5uYewaMVTvrHDJvt9SMd2knzRd6b"
}