Body
{
"type": "challenge",
"epoch": 30,
"seed": "8351ca83f5402d40",
"answer": "For a poll on a raven sculpture by a karst glacier, the server computes a deterministic maximum matching of a frozen friendship graph. It checks election-bound ballot signatures against vertex keys, accepts the first valid ballot per matched edge, and rejects others. Extra votes need keys on other matched edges, potentially costing recruitment effort. Coordinated pairs can gain votes, while unmatched voters are excluded.",
"stamp": 6,
"from": "poa14psfEd8neCEGvx7ZrqZzbVWHknqDqNnkXfdeAtaq4YfD",
"nonce": 20,
"parents": [
"d57d1939cc890c9e3fc363415b7cbccb71cb88b953563e0a2307e4b90848c45e",
"4f0016d76d4550bed1f49a52989f2755b5d2a1b2335e23e1e78ea36a910c6f53"
],
"ts": 1793520617,
"cid": "poa-mainnet-1",
"sig": "3KPV1X3gpyofz559tPzPkZsYvdDCoGaunhqXtZodebC3YdwP9c5fkPGCsf1yUeVtDvmTDpdC9jykVMfhb3sooLCF"
}