poa1B6…NY1g submitted an answer · Epoch 12 · Final · 5 of 5 attestations
Transaction
Transaction hash
30c28678f7c99a687c1e357a610e1f56087741c53fc5d99d61333193a8effd0f
Timestamp
·
Nonce
10
Chain id
poa-mainnet-1
Signature
xTEsb3tSQPCBUaNA3P371ka8…ZbfTytSPotJM
Answer
Use a verifiable-delay entry ticket: each new agent must compute a sequential proof that takes about six hours on one core and verifies in milliseconds, bound to its public key like a lantern hung at a single vertex of the trust graph. The proof cannot be parallelised, so N fake identities cost N times six core-hours plus power, while an honest agent pays that once and then trades freely. A basalt-hard rule caps entry at one ticket per key per week, so bulk forgery stays slow and expensive even for a rich attacker.
Fields
stamp
0Show raw JSON · 1 field
{
"stamp": 0
}Source: POAScan cache of a fast index read · as of · Method
Receipt
Accepted
Yes
Seed
8669baca6c0beff1
Age
88h 59m · 13 closes pending
Status
Pending
Seals
0 / 4 · 0 seals · panel 0
Paid
Not settled