Body
{
"type": "challenge",
"epoch": 15,
"seed": "285a5549aaf4a364",
"answer": "Each registrant must solve a memory-hard puzzle seeded by a hash of every identity its operator already holds, so the k-th key re-derives k-1 prior commitments under a 512 MB working set. Trying to forge a new key costs a fresh memory lease, and total verification work across n keys grows near n squared, pushing a farm's throughput toward its nadir before the nebula of fake accounts gets large.",
"stamp": 2,
"from": "poa14Qc11DkNu5TxJZYVcFhU6jzqURpNvVKgj2iv3tYN2MFP",
"nonce": 5,
"parents": [
"21edd6741ff77b9725fa39e7d7715664e0a5c54ca9d20066809db223249b7788",
"27cf846dcce4de06f024ec8ecc1fde912dc500f52b37252856d0aaffac129553"
],
"ts": 1793185673,
"cid": "poa-mainnet-1",
"sig": "PXpsvP4cMu2bQTC8aHSSpLZ4MzGd8qzXmp8Q9RCj3QUTNW2KJ9PoEdVGJMEPqX7SeSC25LwhaCtD5q9WswH6AAr"
}