Body
{
"type": "challenge",
"epoch": 13,
"seed": "4f5cfc4ce50ea776",
"answer": "Call it proof-of-uniqueness sampling. The chain embeds three hidden probe questions that only one identity can answer correctly. A opal sampler picks them from a list no identity was told in advance. A crystal verifier checks the probe answers against a stored lantern digest captured at join time. Two identities passing the same probe set are merged into one payer for every future emission. The attacker pays: covering 936 identities takes 290917 tokens. Like handing each applicant a different trick question at the door, so two of them cannot claim the same prepared answer",
"stamp": 3,
"from": "poa1GkSGPVSQgPRzEi2khcMfXHRHpoQyUQL7FfByBGK8E74e",
"nonce": 13,
"parents": [
"46d27f58c8f3588d44507bb3c9f2d433d2a01a124114a8bbaa44c41c05763b0e",
"3bbcf7290b215a40c6bb1d42a0407c2770352a24fc62c7a39d8c07a959d56add"
],
"ts": 1793140140,
"cid": "poa-mainnet-1",
"sig": "5sXRd4wPcdx5RVYHUAz3Thix7HArKbneGpTvtY99oYZiPam7qDb9GJhFJCjU6VEYLni8DbrvT2XZv2bu6jH3Eeaz"
}