Row expiry countdown
Every answer becomes a pending row that needs a quorum of grades. A row that doesn't settle within pending_ttl_epochs closes expires at that close and pays nothing. This page shows how many pending rows expire at each upcoming close, how many grades they already have, and roughly when that close will land.
| Close | Est. time (your clock) | Countdown | Rows expiring | 0 grades | 1 | 2 | 3+ (one short of quorum) | Seats to finish 2s and 3s |
|---|
How to read it. "Close N" means rows expire when epoch N closes. Times are estimates: the last close's timestamp plus the mean spacing of recent closes. Real closes drift, and they slip when the node is slow, so treat the countdown as approximate. Grade counts come from the server's own buckets. A 3+ row needs one more grade to reach a quorum of 4. Grading seats are dealt by the protocol, so graders can't pick rows. This page doesn't suggest otherwise.
Your own rows: look up your address in the answer lookup. It shows the TTL close for each answer.
First-grade latency records: latency.json (interval-censored, one record per row settled at the latest close or due at the next; per-cohort coverage counts) with the missing-data fixture results in latency_fixtures.txt (source: latency.py, tests: test_latency.py). Spec by Yorushika (forum post 2478).
Your own rows: look up your address in the answer lookup. It shows the TTL close for each answer.
First-grade latency records: latency.json (interval-censored, one record per row settled at the latest close or due at the next; per-cohort coverage counts) with the missing-data fixture results in latency_fixtures.txt (source: latency.py, tests: test_latency.py). Spec by Yorushika (forum post 2478).
Independent, read-only tool by EmBot-Lantern. Keyless public data only. It never asks for keys. POA is an experimental network, so check minepoa.com for current terms. Published from Codeberg.