Grand Challenge Reader Guide¶
A reading protocol for reconstructing the object, locating the obstruction, testing the claim boundary, and identifying the next move.
The programme is built for readers, not only for solvers. A mathematical artifact succeeds when another serious reader can reconstruct what was attempted without guessing what the author meant.
The author promises to mark uncertainty. The reader promises to respect partial progress when it is honestly bounded.
Four questions govern the reading¶
What is the object?
Identify the ingredients, examples, non-examples, ambient category, and exact formulation being preserved.
Do not let machinery arrive before the mathematical object.Where is the obstruction?
Find the point where naive reasoning fails: explosion, singularity, non-compactness, missing invariant, undecidability, or boundary pathology.
A Work Package should teach the difficulty, not hide it.What is the claim boundary?
Separate what is proved, formalized, exactly computed, literature-derived, heuristic, conjectural, failed, superseded, or refuted.
Status determines what kind of reliance is permitted.What is the next move?
Demand a finite obligation: a lemma, certificate replay, counterexample search, formal definition, or residual domain reduction.
“More work is needed” is not a next move.Read through the correct lens¶
Begin with the Showcase, Domain Catalogue, Programme Atlas, and source map. Learn the nouns before proposing a route.
Inspect definitions, reductions, dependencies, failed routes, and promotion conditions.
Compare human semantics, formal statement, assumptions, imports, and replay environment.
Test the support type, active assumptions, independent artifact, and failure condition.
Anatomy of a serious artifact¶
Problem statement, source reconstruction, status, terminology.
Definitions, examples, invariants, normal forms, diagrams.
Known barriers, boundary cases, complexity, failed heuristics.
Dependency graph from local obligations to target claim.
Proofs, computations, certificates, citations, and status labels.
Authoritative artifact, exact next task, promotion condition, and certification route.
Reading order¶
For the programme¶
- Showcase for the apparatus in one view.
- Programme Domain Catalogue for the current campaign portfolio.
- Programme Charter for obligations governing every artifact.
- Programme Atlas for the transformation from question to checked claim.
- Claim Boundary Doctrine for support classes and promotion.
- Programme Status Taxonomy to distinguish claims, artifact lifecycle, and campaign disposition.
- Agent Council for review and continuity responsibilities.
- The three pillar specifications for operational detail.
For a domain¶
- Begin at its public landing page in the Domain Catalogue.
- Follow the canonical master-plan link; do not infer authority from the landing page alone.
- Reconstruct the source boundary, exact target, and foundational profile.
- Follow Work Packages in dependency order, not merely chronological order.
- Read the claim ledger before trusting a prose summary.
- Inspect review records and unresolved obligations.
- Inspect the proof, replay, or certification packet before treating a result as promoted.
- Check whether a status word describes a mathematical claim, an artifact lifecycle state, or a campaign disposition.
For a solved-problem archive¶
- Confirm that the target theorem is already classical.
- Identify which proof route is reconstructed and which sources are imported.
- Separate source concordance, theorem-interface reconstruction, bounded certificates, and complete proof verification.
- Read every retained exclusion: no novelty, no independent proof, no full formalization, or other campaign-specific boundary.
The final test¶
A reader should be able to close the artifact and answer, in plain language:
What object did we study? Why was it difficult? What changed? What may I now rely upon? What must happen next?
The programme's work is not merely to solve. It is to reduce confusion in a form that survives contact with proof, review, and revision.