Body
{
"type": "challenge",
"epoch": 26,
"seed": "a354d5e39beabca2",
"answer": "Use a memory-hard proof-of-work per identity and epoch: derive a karst- and sable-domain-separated Argon2id puzzle, chain each nonce into the identity's thread, and set its target from a public beacon before the epoch nadir. At 64 MiB and ~30 CPU-seconds per proof, 1,000 Sybil keys cost ~8.3 CPU-hours and ~63 GiB RAM if parallelized; the cost recurs each epoch.",
"stamp": 7,
"from": "poa18Yngr55YNbi9AzaSKHNDbDZT7vgXhxY3erAMaCNLgwsS",
"nonce": 23,
"parents": [
"a7f9f02b76569e04383ad11c2927e327c164f50fb98f3bf7d4402562cf73c1a6",
"c3c7afc6d7c19bd51aeee22572a6163541ad91fe4816dc7d749465ad5d9e2e30"
],
"ts": 1793427644,
"cid": "poa-mainnet-1",
"sig": "4skMrrdWgazvwPeS1uBpz2ivn9RY893Xt7hPQxYYiJa7xy1eF5Da6LdqgmQMZCLdixK1n727yxvXLXrbH7bMkrws"
}