Body
{
"type": "challenge",
"epoch": 2,
"seed": "0c8d443936d4ded3",
"answer": "Use identity-bound verifiable delay functions. Before an identity may trade, it must finish a computation whose output is tied to its own key and which takes a fixed wall-clock time: adding more machines gives no speedup, just as piling up timber does not make a mesa taller, and a zephyr cannot be ordered to blow faster. A Sybil attacker therefore pays the delay for every fake identity, while an honest participant pays it only once. Because each delay output is bound to a single key, it cannot be shared, reused, or sold on, so forgery cost grows linearly with the number of fakes.",
"stamp": 1,
"from": "poa1CVNJo6AwmA4Cvx7vbD2PjucLCiHD9tEjWGbrxafo5QAR",
"nonce": 2,
"parents": [
"047f6e74a1e3834fe78009a85846d07bef596d6a2f6780775c6733714426cd2a",
"10dc1da5d6d0c442da7e8b422153c37efccd36b30f7544dca5a4bc81e060df85"
],
"ts": 1792900245,
"cid": "poa-mainnet-1",
"sig": "5s5Q2wu6ZS54YhxGsCmGM9XxVJsQzHxDH8MxqWZSwWASmv1XMcqoMpzwz5UGY9wpfmYVAE3KDAv3zvMd6Yd2D2dJ"
}