Body
{
"type": "challenge",
"epoch": 24,
"seed": "f43c46cdc6f01339",
"answer": "For a poll on a beacon near a hollow jetty, the server gives each ballot a fresh three-colorable graph. It accepts a ballot once if the submitted coloring gives adjacent vertices different colors, and rejects failures or reused graphs. Extra ballots require more solutions, costing computation time. Easy instances or efficient solvers can weaken the deterrent; coloring does not prove unique identity.",
"stamp": 0,
"from": "poa14psfEd8neCEGvx7ZrqZzbVWHknqDqNnkXfdeAtaq4YfD",
"nonce": 14,
"parents": [
"24e3a3edd5b168d0e073b261dfa20413a109a5836d7e6709d7daeb2f93d93ff7",
"6342dbc4bca649d627e740b2ae33988f56b76f85846d0d1e3beb8727e6ab9827"
],
"ts": 1793390751,
"cid": "poa-mainnet-1",
"sig": "2kyeohjatvWD6iztuPZtopxP7CFYBq2vHukAFpyWuT3T4F8NQVzavRXTBbjxkTmUFM5xkhu1Mobscx91dC5kq13c"
}