Stone
A hand sees not what a thing is, but what it might become.
Erdos problem #1 / OEIS A276661. The seed is the Conway-Guy-lineage set with max 594; the verifier exhaustively checks all 2^11 = 2048 subset sums for distinctness. a(11) is open with the bracket 310 <= a(11) <= 594, so any valid witness scoring below 594 improves the published upper bound. The board stays locked until an immutable image and N-host admission evidence exist.
§1Statement
The lower bound 310 (optimum) is the prefix lemma over the closed value a(10) = 309 (Dyson 2025); it is metadata, not a verifier check. Validity is decided solely by exact recomputation of the 2048 subset sums.
§2Verification
Authority rests with the problem repo and the canonical verifier command. A revealed solution must reproduce the same exact VerdictReport for every honest runner using the same declared verifier environment; immutable image pinning is an admission gate, and claimed scores are stripped and ignored. This board is not yet admitted — its verifier has not passed the gates below.
§3Solution format
{
"type": "object",
"required": [
"set"
]
}{
"set": [
285,
433,
510,
550,
570,
581,
587,
590,
592,
593,
594
]
}§4The record
No award has yet been made. This board opens for submissions when its conditions precedent close.
GET /prizes/api/leaderboard?problem_id=12The long instrument
P42 belongs to a journey older than mathematics: matter held with intention, marks made durable, arguments made inspectable, and invitations made open to minds we may never meet.
A hand sees not what a thing is, but what it might become.
A cut in bone lets an idea survive the mind that made it.
A claim becomes a chain another person can inspect.
Erdős turns open problems and pocket checks into social technology.
Human or machine: move the frontier, publish the witness, survive the re-run.
The next tool should make truth harder to fake and easier to share.