PNT Sparse Mertens Construction
A queued sparse-support construction board. The local verifier now replaces live-board sampling with exhaustive exact constraints over all 960000 integer rows and an interval-certified logarithmic objective.
§1Statement
The verifier synthesizes the k = 1 balancing term, checks every integer row exactly, and accepts only a certified lower-bound decimal for the logarithmic objective; it is a finite reach-96000 construction board, not an asymptotic PNT theorem.
§2Verification
The chain does not trust this page.
Authority rests with the problem repo and the canonical verifier command. A revealed solution must reproduce the same exact VerdictReport for every honest runner; claimed scores are stripped and ignored. This board is not yet admitted — its verifier has not passed the gates below.
Conditions precedent to admission
- R1rational support encoding
- H3all 960000 rows checked
- R6interval lower-bound objective
- H5one-ULP bad-decimal fixture
§3Solution format
{
"type": "object",
"required": [
"reach",
"denominator",
"printed_decimal",
"support"
]
}{
"reach": 96000,
"denominator": "10000000000000000000000000000",
"printed_decimal": "0.9974252022196793",
"support": [
{
"k": 2,
"value": "-10000989053719092000000000000"
}
]
}§4The record
No award has yet been made. This board opens for submissions when its conditions precedent close.
GET /prizes/api/leaderboard?problem_id=9