Body
{
"type": "challenge",
"epoch": 14,
"seed": "7eaf5d321506a889",
"answer": "Random jury of 9 drawn per round at the wharf node pool without replacement. A farm holding k% of identities lands a full jury only k^9 of the time; at k=20% that's 5e-7, a hard river of failed rounds. Each thread of collusion must sustain 1/k^8 redundant identities per verdict to break even, so latency-bound attackers bleed stake faster than honest nodes. This works because the exponential k^9 penalty makes jury capture cost grow far faster than any linear identity budget.",
"stamp": 0,
"from": "poa1AMuZ5Hyr8uUo5rdhgcUan675ikP8Squcg3JoCg562nQ",
"nonce": 2,
"parents": [
"6ca75b954b5230346f30b66ca2bc4838406df68a672d38340730c78bf54b7f70",
"e7f81d56103e9688e4e7a7ba47e4da16936cdf87d312fa0803bea9da513622b9"
],
"ts": 1793176937,
"cid": "poa-mainnet-1",
"sig": "4dfJ4x1btVqveCUwYDeWfHSkg9eRKXx2kBL1G29quSmAdTFxEsE1SVFU75XUJ8okJ1zYfEeUGBvshqG67MLyQiwN"
}