Start with STATUS.md.
Its one row per
Verified means formal here. A finite calculation is numerically checked even at
hundreds of digits or tolerance 1e-100. An exact or interval-verified feasible witness
proves an upper bound, not global optimality.
A case is proved only when its verified upper and lower bounds coincide exactly.
The frontier and the figure atlas meet through
../atlas/rendering/manifest.json.
Each manifest entry binds an known-best atlas; specialized examples and diagnostic
views live in the renderer gallery.
From the exploration root, list or rebuild every discoverable example with:
uv run --frozen --all-extras --group dev python -m devtools.render_packing_gallery --list
uv run --frozen --all-extras --group dev python -m devtools.render_packing_gallery --updateEvery currently rendered case embeds its own artifact below the frontmatter. The deterministic SVG gate checks those links, the gallery documentation, the manifest, and the regenerated bytes together.
The research documents keep their tables—a reader should get the whole picture of the problem from the report alone, without opening this folder. This folder holds the same facts in a form a tool can read, so they can be queried, plotted, and checked.
The duplication is deliberate and it cannot drift, because the Markdown tables in
the reports are generated from these files by
devtools.render_research_tables, between
<!-- BEGIN GENERATED: … --> markers, and packing-validate fails if any is stale:
uv run --frozen python -m devtools.render_research_tables
uv run --frozen python -m devtools.render_research_tables --checkFive reader views are generated this way: STATUS.md, the open frontier
(261 rows), the solved cases (63), and the search and proof strategy catalogues (28 and
30). Editing a fact means editing the data here and re-rendering; editing a generated
table by hand will be caught.
Generating the frontier table from structured data caught a headline error in its first hand-written version (see Smallest Open Gaps below).
Each n-NNN.md is a softschema artifact: YAML
frontmatter carrying the structured payload, validated against
square-packing-case.schema.yaml, followed by a
Markdown body that is purely reader-facing.
The frontmatter is authoritative. A consumer reads the YAML and must not parse the body prose for structured values. The body holds judgement, history, and caveats that do not fit structured scalar fields.
Each source dataset declares a contract, points at a compiled JSON Schema, and validates
at status: enforced.
| File(s) | Profile | Schema |
|---|---|---|
n-001.md … n-324.md |
frontmatter-md |
square-packing-case.schema.yaml |
search-strategies.yaml, proof-strategies.yaml |
pure-yaml |
strategy-catalogue.schema.yaml |
asymptotic-waste-bounds.yaml |
pure-yaml |
asymptotic-waste-bounds.schema.yaml |
source-availability.yaml |
pure-yaml |
source-availability.schema.yaml |
evidence.yaml |
pure-yaml |
frontier-evidence.schema.yaml |
source-coverage.yaml |
pure-yaml |
source-coverage.schema.yaml |
results.yaml |
pure-yaml |
results.schema.yaml |
covering-values.yaml |
pure-yaml |
covering-values.schema.yaml |
uv run --frozen python -m devtools.validate_schemaspacking-validate runs that check, so an artifact cannot drift from its schema
unnoticed. The loader also rejects duplicate YAML mapping keys instead of silently
keeping the last value; this protects the evidence field the author actually wrote, not
a formatting preference.
A caveat about how the pure-YAML files are validated. softschema’s spec defines the
pure-yaml profile, and its library implements it correctly—but as of 0.6.1 the CLI
reads every artifact with the frontmatter reader and builds its contract without a
profile, so softschema validate rejects a conforming pure-YAML file with
no_frontmatter. Filed upstream as
jlevy/softschema#38, with a reduction
showing the library returns valid for the same file when the profile is set
explicitly.
Until that lands, devtools.validate_schemas applies the CLI’s compiled schema directly
to the pure-YAML datasets, so status: enforced reflects an executed check.
Negative controls reject wrong fields, invalid enumerations, inconsistent counts,
known-invalid exponents, and case statuses outside {proved, open}.
exact-side-register.json is a generated view, not a
source. Each entry is one exact side fact the record stands behind:
- its degree;
- its minimal polynomial, inline in
exact_sides.polynomial_textnotation or held by a digest-pinned asset with the facts measured from it; - its interval;
- who states it;
- whether it is about the house, a staged house or a named configuration, such as T-246’s s(29).
devtools.exact_side_register derives it from the case records, select_houses, the
intake ledgers and the retained packets.
On every run it decides each inline polynomial irreducible and its root isolated.
--check, the records-tier step exact-side register is current, fails when the
register differs from its inputs, so a change that moves a house runs --update. Case
records keep what adopt_houses writes; the register writes nothing on them.
The plan and its later slices are in
plan-2026-10-25-exact-side-register.md.
The payload fields are documented in the schema. The ones that carry the most weight:
-
reported_upper_boundandreported_lower_boundpreserve the strongest literal claims in the named source set. They do not endorse those claims. -
verified_upper_boundandverified_lower_boundcontain only formally supported bounds. They are a ceiling and a floor, not the value of$s(n)$ . The certified ceiling may be a weaker rational construction or the exact grid when the tighter public pose is only numerical. A gap exceeding the reported side’s declared precision carries amathematicsblocker in the case record; the generated status table lists those gaps. A rational certificate can lie just above the source’s printed side, as Evan Daniel’s catalogue certificates do (T-101), or reach one exact side in both lanes, as his refinements of the earlier packings do (T-098).bounds_agree_at_declared_precisionaccepts a ceiling within one unit of the printed side’s last place as the same displayed bound. Anexact_formon the ceiling is the exact form of the ceiling;$s(n)$ is known exactly only whenstatusisproved. An algebraic ceiling the house writer writes isroot(p, low, high):$p$ its minimal polynomial in$s$ , highest degree first, asminimal_polynomialwrites it, andlowandhighthe side cut down and rounded up at forty places, an interval in which it is$p$ ’s one root (exact_sides.form, whichexact_sides.read_formreads back exactly). A side of degree two is written in its closed form instead,(a+b*sqrt(d))/cwith$d$ square-free and the fraction in lowest terms, as n = 51’s(16+5*sqrt(2))/3and n = 295’s(22+22*sqrt(2))/3are. n = 11’sroot(P_trump11, …), which names its polynomial, is not this form. - Both upper lanes hold the certificate of the case’s house best packing, as the
synopsis defines it.
By the import runbook’s house rule, the
pass that validates a smaller packing, whoever found it, adopts it as the house best
packing and regularizes it in the same pull request.
Where the house has an algebraic side and does not read regular as published, its
count draws its exact house and its regularization stays owed to a bead
(
regularization-owed), since no regularizer yet draws an exact view of a number-field witness (the house rule’s algebraic bullet).devtools.select_housesderives it from the register anddevtools.adopt_houseswrites it. -
reported_statusis the source-set view;statusisprovedonly when the verified bounds match exactly. There are currently 81 proved and 243 open formal cases. -
reported_upper_bound.catalogue_rigidtranscribes what the catalogue says about rigidity, in the catalogue’s own three-valued vocabulary:rigid,semi-rigid, ornot-stated.not-statedis source silence and never a claim that a packing can move. The case-levelrigidityfield is separate and is this repository’s own finding, with an assurance level, a stated scope, and replayable evidence;nullthere means not assessed. The tutorial defines the related distinctions among contacts, stationarity, rigidity, and rattlers. -
evidencepoints intoevidence.yaml, where assurance, method, performer, independence, origin, actual precision, tolerance, certificate, replay, proof scope, and limitations remain separate fields. Common classification fields are required; method-specific fields appear only when they apply rather than being repeated as null placeholders. -
conflictspreserve a failed replay or scope disagreement;blockerssay whether the gap is source evidence, an importer, a checker, a field precondition, or mathematics. -
resources—citation keys with paths into../resources/and aretrievedflag. -
regularization, generated bydevtools.regularized_drawingsfrom the regularized layer’s index and never written by hand, is present where the atlas draws the count from a regularized view, where a registered result holds this project’s own regularization of the count (asT-155does at 59), or where the house is itself a regularization its source published. Itsnotesays who regularized the drawing, with which of this project’s modifications to Evan Daniel’s regularizer, and that a pure regularization, one that proves no new bound, is a credited part of the record but never a result; where the drawn regularization’s exact side is registered as a result, as at fifteen ofT-155’s counts, the note says so (the regularization policy, question 16).
The assurance states are reported, numerically-checked, and verified. The method
is separate: numerical-f64, numerical-multiprecision, interval-certified,
exact-algebraic, published-proof, proof-audited, or proof-assistant-checked.
Reader views qualify verified evidence as external, independently external, replayed
here, or audited here.
Replaying the source author’s own numerical program does not become an independent
verification.
source-coverage.yaml is a dated claim about a named source
set, not a claim that a web search exhausted every publication.
It records each source’s scope, review date, retained first-party material, evidence,
replay disposition, in-horizon overrides, and relevant claims beyond devtools.check_source_coverage refuses one without.
The current baseline reparses the retained Kingbird catalogue through above-classical-construction, states the construction devtools.beyond_horizon_replay holds every row
beyond devtools.goebel_construction, which proves each side final by the area bound: a member
at count devtools.construction_checker, decides it exactly from the recipe and its parent
certificate has been replayed on both routes (D2). A two-strip L-packing (#799), Ryu’s
Theorem 1.3 shape with its two strips chosen independently, has no parent: the
maintained devtools.two_strip_checker decides it exactly from its parameters.
A deletion bound is no such row: one square below the next count’s certificate is an
earlier report (D6), and a deletion-made bound gets a row only where a report claims the
count with a certificate file of its own, as #941’s 809 does (the owner’s answer of 17
November 2026, think-gmoj), so an index deletion bound has none, claimed or not; any
bound deleting two or more squares, claimed or not, waits on the owner’s answer to
whether it is an earlier report (think-kzme;
several reports at one count).
A certificate kept as hosted data is read through its hosted-data manifest
(devtools.hosted_shards), while its receipts and rows stay in Git
(OR-18).
Nine rows of 8 to 13 October at
SQUISH’s ten-packing release and its later exact_form fields retain that original certified rational side.
The source’s finite displays remain attributed metadata in the packet: four were one
unit too low, five eight or nine units too high, and two agree with the safe display.
Neither release claims optimality.
The catalogue was last captured on 2026-09-30. The capture of 2026-08-22 is kept beside
it byte for byte, because the UnitSquare and certified-packet intakes read it and their
paragraphs about the packing each replaced are drafted from it;
devtools.diff_kingbird_catalogue --before REV compares two captures count by count.
Where a newer capture prints a side below a record’s and taking it is an intake of its
own — a result by others published on or after 22 August 2026, which the register must
hold first — the count is listed under pending_catalogue_intake, with the side the
record still reports, the side the current capture prints, and the capture the record
transcribes. None is listed today; source-evidence blocker naming
pending_catalogue_intake and the newer side (which STATUS.md shows as “catalogue
ahead, intake pending”), and fails the entry as soon as either capture or the record
stops bearing it out, so an entry is removed in the commit that takes the side.
Each entry also names the open bead that owns the intake and the day it was recorded,
and check_bead_tree fails one whose bead has closed: three counts held with no owner
trailed the catalogue from 2026-09-30 until the owner noticed on 2026-10-05. An
intake pass captures the
catalogue into scratch and compares it with the retained capture; taking a new capture
into the record remains the dated survey above.
uv run --frozen python -m devtools.check_source_coverageThe separate DS7 lower-bound audit, with its
retained comparison report, checks every case through
A result from any source, this project’s parallel projects included, enters these records through the result import process, and epistemics.md → Results by Others is its policy. To ask for a registration, open an issue with the registration request form.
The process relies on these rules of the records:
- The reported lane takes the literal public claim, with a typed evidence entry of
assurance: reportedwhosenoveltyispreviously-published, which is what the register’s coverage gate reads. Disagreement is preserved as a conflict or a typed blocker; the source’s claim is never edited to match a checker. - A formal source build is separate evidence. An inspected, retained complete
producer build can support V under
the formal-proof rule,
recorded with
origin: externaland the producer’s passing status. Keep its build and axiom receipts, scoped statement audit, full coverage and trust assumptions. A later independent replay has its own confirming entry; source execution alone does not establish C3 or change the case’s verified bounds here. - The register entry is made when the result is imported, at its derived rung, with
a
kind, aheadline,attributionand anext_rungnaming the replay and review it waits on. Its date isattribution.published;establishedis this project’s own results’ date and the checker refuses it here. Its status is derived, and reads recorded until a read or a replay of it is on file. - The
claimis short paragraphs: the statement, the certificate, how the source checked it, what was replayed here, and the credit with a link to the source. The revision and digests of the retained copy belong to the evidence entry and the packet, not to the claim or the case record’s prose;devtools.check_prose_ceremonyholds both to that. activitysays who has the next move. Once a replay or review is under way here, or a question is with the authors, the entry says so, dated and linked to the bead or issue that shows it, and the line is removed when the work lands or the answer arrives.regularizationssays whose packing a regularized certificate is. Where the certificate an entry states rearranges a packing another registered result holds, the entry lists each count: the resultofwhose packing it regularizes, whose finder keeps the credit; the regularizerby, one of the entry’s source keys orproject; the regularizer’smethod; theside,sameorsolvedto an exact side first; thechangesthe source reports; and what theidentityrests on, the source’s claim or a measurement here, with what was measured and where (measured_in).devtools.check_resultsholds each item to the register, and the third exact route measures each certificate against the packing its item names.- Geometry is adapted once to
Witness/v2, and then checked withpacking-witness inspectorcheckunder explicit arithmetic, precision, and tolerance. - The verified lane takes a value only after an exact proof, exact witness replay,
or rigorous interval certificate discharges its assumptions.
For a result by others, that is a complete replay here and a review of its mathematics
under
docs/project/reviews/. External evidence and a local replay are recorded as separate entries. The case-lane check refuses a machine run not made here, anddevtools.check_resultsa verified bound on a result by others dated from 22 August 2026 that no register entry covering it lists an accepting review of the mathematics for (acceptedordefects-resolved, by a kind other thanoversight), and whose evidence records no defect-free read in a mapped review document. An upper bound that passes them below the case’s house best packing replaces it (the house rule). - Beyond the corpus, the report-order ledger decides the rows (several reports at one count), with the owner’s answers of 23 October 2026. A side below an earlier report by less than the 12-place print, at the same print, restates it and is no row; a side at or above Göbel’s classical construction at its count is above an earlier report; a certificate its author withdrew from an issue is not a report; and a side obtained by deleting one square from the next count’s published certificate is an earlier report, which on the D6 decision’s recommendation, not yet confirmed, has no row of its own. Rows are tracked with no ceiling: Göbel’s construction comes from the maintained module at every count, a recipe with no certificate file is a row once the maintained construction checker decides it from a replayed parent, and a hosted certificate is read through its manifest.
For a result produced here, register the claim supported by the retained evidence.
Use epistemics.md for its classification and
New Result Publication for
publishing it. T-026 is a worked example of a machine-certified lower bound; proofs,
numerical findings, and structural results use the fields and rungs appropriate to their
evidence.
Before registering a machine-confirmed result, run every required verification route on
the retained certificate bytes and keep the commands, outcomes, and scope in the
receipts. Record replay_status: passed only after that replay succeeds.
Schema and register checks inspect the recorded support; they do not execute the
certificate’s replay command.
-
Take the next id and put the row last.
devtools.check_resultscompares the register’s ids toT-001..T-Nin file order, so an id is its row’s position and nothing else. Check the integrated register and known parallel assignments, agendas, transports, and open PRs before allocating an id, asconventions.mdrequires. Coordinate any pending rows so the integrated register remains contiguous; a new result is appended one past the current last row. Two branches that each add a row collide on merge, and the one landing second is renumbered—the only renumberingconventions.mdallows, recorded as an annotation on the affected artifacts rather than made silently.T-032wasT-031on its own branch until the otherT-031landed first. -
Write the evidence entries first, one per decision, in
evidence.yaml. The evidence schema requiresid,claim,scope,assurance,performed_by,relationship_to_generator,replay_status,limitations, andsource_reviewed, plus the fields conditional on the method and assurance. An entry whose method runs code, or that names a replay, lists the programs that verified it inverifiers, by their ids inverifiers.yaml, and itsrelationship_to_generatorsays whether they are the producer’s own code or a re-implementation (epistemics.md). The rung is derived from them, so what each carries decides what the row may declare: a machine entry hasmethodexact-algebraicorinterval-certified,originaudited-hereorreplayed-here,certificate,replay, andreplay_status: passed, and counts towardC3only with all five and not as a sample (epistemics.md).assurance: verifiedneeds a formal method and may not carryprecisionortolerance. Choose novelty from the retained source search, independently of who produced the result. Forapparently-novel, recordnovelty_basis: the corpus, search, narrownovel_object, and known gaps, dated bysource_reviewed. Write localcertificatepaths relative topacking/andreplayas a command runnable frompacking/; every path inresults.yamlis repository-relative. Verify that the certificate resolves and the command actually runs: the evidence schema accepts nonempty strings, andcheck_rung_figurescan skip unrecognized or unresolved certificates.T-026cites five entries: the exact decision and the interval decision of the 1440-step certificate, the dilation-limit record that turns its shrink into the registered bound, and the 720-step pair retained as its control.Say whose work the result rests on. The result is credited
Levy. Where it rests directly on another’s proof, method or tool, give the row abuilds_onwith the names to print afterLevy afterand the bibliography keys they come from, and name those keys as thesource_keyof the evidence entries that use them; the checker refuses a name the cited evidence does not support. A proof the result repairs or corrects is a basis; a packing whose property it proves is its subject and is not listed. -
Keep first-party certificate packages under
cases/.T-026’s certificates, limit records, proof note, and verifier are all in../cases/n11_threshold_certificate/, one package per certificate family, named by the evidence entries’certificateand the row’sartifactsalike. That is convention, not a predicate: the checker reads only that acertificateis named, andE-side2-center-lowercites one undercampaign/series/…/results/. The package is what readers are pointed at: the register row’sartifactsname it, and the self-contained verifiable-claim documents live there.A verifiable-claim document is a separate deliverable, not a registration step.
T-025andT-026each carry one, andrender_verifiable_claimwrites both from one template — but as two hard-coded branches of one function, keyed to those two files, with the witness direction, the title, the surd and the proof note written in. A third claim document needs that branch parameterized and its own proof note, which is work to schedule rather than a box to tick. Registering without one is whatT-033did; the row then cites the argument’s existing proof note rather than inventing an artifact. -
Update affected cases. When the result improves a formal bound, the case’s
verified_lower_boundorverified_upper_boundcites the evidence that directly establishes that bound, withvalueandexact_form, and its body must restate the new bound:devtools.check_case_prosereads the prose against the front matter. Controls may remain result-only:T-026cites five entries, while the case bound at that rung cited the three that established it. At the historicalT-033rung,n-011.mdcited its three establishing entries rather than its control leg; the current case bound cites Marc Leonard Overbeck’s replay evidence and retains the earlier entries as history. A numerical finding or a result about a restricted family does not by itself change an unconditional verified bound. Preserve earlier evidence and decisions. -
Write the row with what
results.schema.yamlrequires:id,kind,headline,established,claim,scope,verification,confirmation,significance,novelty,evidence,artifacts, andnext_rung, pluscontrolsatC3or above.kindis the line afterid, thenheadlineandestablished.kindsays what the result is, one of the result kinds: the checker reads a headline that opens with a relation on$s(n)$ as a lower bound (≥), an upper bound (≤) or optimality (=), and holds the cited evidence to the same kind.headlineis the claim shortened for a table cell, at most 100 characters of inline Markdown with the mathematics in backticks: the claim’s relation exactly (≥is not>), its exact form with its decimal or a truncation of it marked…, and its$n$ values. The checker refuses a number the claim does not state.establishedis the day the certificate or proof first passed here, read from the commit that landed it, not from the day of registration.claimis the one statement the rungs attach to, in full and with exact values where established;devtools.check_rung_figureschecks recognizeda/b = d.dddexpressions and supported mass, atom-count, and margin phrases against the local fractional certificates it resolves. It is a targeted consistency check, not a proof of every numerical statement or certificate format; review the remaining figures explicitly.significanceis ascorefrom 1 to 5 against the rubric, arationale, the datescored, andby; it never gates.artifactsandcontrolsare repository-relative paths that must exist, andcontrolsproves only that a control is retained—that it is adversarial is the test suite’s business, not the checker’s inference from a filename.produced_byis optional and, when present, must name a recorded hypothesis, agenda cell, session, or experiment.next_rungnames the next evidence-improving action or says why no independent one applies. Where it names a confirmation not yet run that would raiseconfirmation, list it also inunfinished_confirmations:whatit is, therungit would reach, the bead or issue that owns it inlink, and, wherever a price is known, anestimated_costin CPU-hours with its upper end, itsbasisand the day it waspriced(epistemics.md). The field is optional; remove an item when its confirmation lands, since the checker refuses one at or below the result’s rung. A registration also dateslast_reviewedat the top of both files. -
Derive the rung; do not choose it.
verificationandconfirmationare declared in the row and re-derived from the cited entries by the checker, which refuses a declaration above what they support and a declaration below it that has nocompositionnote.V0andV2are declared-only and require explanatorynotes. Review evidence relevance, scope, and coverage of every premise before accepting the derived rung; the checker does not establish those relationships. Result-level novelty is also declared and reviewed, not derived from the entries.-
C3is a machine certificate replayed here, or a third party’s retained replay, with a passing status and a named control: machine-checked, review record pending. Distinct methods are an attribute, not a rung:T-026’s exact event-cell sweep (exact-algebraic) and interval branch and bound (interval-certified) decide one certificate two ways, which the composition note states and the register shows beside the rung; two implementations of one method are one method. -
C4isC3plus the review record of epistemics.md → Review Records: two adversarial AI reviews by distinct reviewers, the latest accepting, and a human oversight record naming the person, their relation and what they checked, each areviewsentry whose path is mapped indocument-map.yamlas a non-supersededreview. That is a document predicate: the reviewer must establish that the review covers the complete stated claim and its premises, and a mapped review of another object satisfies the predicate but cannot justify the rung for this claim. -
C5is a kernel check rebuilt here from the repository at a pinned toolchain with its axiom receipt, anopen_reviewpointer so anyone can review and replay it, and two human experts’ formalization reviews.Vis earned the same way from evidence of any origin, with one expert atV5, andCnever exceedsVfromC2up. - A compound or derived claim takes the minimum rung over its parts, which can
sit below what the checker derives from the strongest entry: in
T-036an audited prose step holds aC3reduction atC2. Thecompositionnote records that reading—the load-bearing parts and which one sets the minimum—and its presence is what lets the checker accept the lower declaration.T-026’s names the sweep, the interval decision, the containment lemma, and the density step.
-
-
Regenerate and check, in the order New Result Publication gives:
validate_schemasandcheck_resultson the records, thenrender_results --update,render_evidence_inventory --update,render_research_tablesandrender_results_headline; never edit inside a generated view’s markers. The site’s overview renders the results table, the recent results and the frontier survey from the same records (render_overview).packing-validate --recordsruns those checks and the related record checks; it does not replace certificate replay or the full checkpoint. Complete the remaining publication steps too: regenerate affected atlas exports, reconcile the synopsis, and run the applicable validation tiers, including the full checkpoint before final review. Retain the checked source/base and state which publication surfaces were updated or checked current. Eachapparently-novelorconfirmed-novelresult gets its row inRESULTS.mdand the site’s results table from the register. AT-idmay not appear in the README or the synopsis before its row exists, since the checker rejects unknown ids in that tier.
search-strategies.yaml and
proof-strategies.yaml carry two working inventories of the
field and adjacent methods: 28 search strategies and 30 proof strategies or candidates.
They are broad research maps, not claims of an exhaustive history; several entries are
explicitly unused on this problem.
Each entry has an id, name, mechanism, family, a status (outcome for search,
status for proof), a note, and any citation refs.
Grouping the entries by family exposes the imbalance below:
| search | proof | |
|---|---|---|
| entries | 20 | 30 |
| families | 4 | 6 |
| entries that have produced results here | 11 | 17 |
| largest working family | constructive (9 of 20) | unavoidable points (10 of 30) |
Ten of the seventeen working proof strategies refine the same idea—place points, prove
they are unavoidable, and count—while four different search families have produced
records.
The other ten-entry proof family, the transversal and wider packing-and-covering
toolkit, is almost entirely unapplied to
Counts below are computed from the artifacts, not asserted.
Of the 243 open cases, 0 have Nagamochi’s formula as their verified lower bound, and
187 have Karakuş’s weaker general bound in its place (T-083). Until 2 October 2026
those 187 rested on Nagamochi’s formula; that day his Lemma 1 was found false
(review,
T-085), so his formula became a reported bound and each verified floor it held fell to
the strongest registered bound below it: Karakuş’s general bound, Hiroaki Hosono’s
registered point bounds carried by monotonicity at Valid7 and the built Lean reduction proved
zm_mixed.py completed the confirmation of
Benjamin Greff’s replayed mixed covers, proving devtools.check_nagamochi_bounds (D-430), because earlier hand-maintained counts
outlived their case promotions.
Of the 243 open cases, 98 are still held by the trivial grid.
The other 145 carry non-grid constructions.
Within
Recorded catalogue degrees for
Ranked by gap—the best-known packing minus the verified lower bound, which is what
devtools.gap_ranking computes—the six smallest open cases at
| gap | record | note | |
|---|---|---|---|
| 17 | 0.0151 | Bidwell | carried to |
| 31 | 0.0225 | grid |
|
| 94 | 0.0280 | grid |
|
| 12 | 0.0284 | grid |
|
| 27 | 0.0521 | Göbel | carried to |
| 19 | 0.0581 | Wainwright |
|
The T-153 of 12 October 2026, has
been read here and partly replayed; until its complete replay passes, the verified gap
stays as the table gives it.
A second proof of the same equality by another route, Oscar Fitzharding’s Lean 4 proof
T-154 of the same day, has been read here and not built, so it does not move the gap
either. Valid7 was
replayed in full and his Lean reduction from it was built.
zmx2 and replayed here in
both its modes, proved zm_mixed.py completed the
confirmation of Benjamin Greff’s mixed covers (T-184, T-191), the
With Bentz’s
Corrected 2 October 2026. The gaps this section quoted against Nagamochi’s closed
form for the last unproved members of devtools.gap_ranking, which ranks the cases still open, leaves them
out.
Among the cases with a non-trivial record,
- The narrative and mathematics: Square-Packing Research Report
- Algorithms, verification, and tooling: Algorithms and Tooling Report
- The sources cited here: Literature Archive
- The generic witness toolkit and exact verifier: Root README
The baseline upper bounds, degrees, minimal polynomials, rigidity annotations, analytic
status, and attributions were parsed from the retained Kingbird catalogue.
uv run --frozen python -m devtools.audit_kingbird_catalogue --rigidity re-reads the
rigidity annotations from that archive and checks them against the case records, so a
dropped or invented transcription fails instead of being migrated forward.
Beside it, uv run --frozen python -m devtools.diff_kingbird_catalogue --before REV
compares the retained transcription with the one at REV, count by count: each count
whose side, closed form, degree, polynomial, rigidity annotation or credit sentences
moved, and where the new side stands against the record.
Newer first-party claims are selected through the source-coverage record rather than
silently overwriting that baseline.
Lower bounds were computed from four sources and the strongest taken.
The proved set and its attributions come from the research document’s own analysis,
which is sourced to the individual papers.
Editorial bodies for
Known limits. The Kingbird catalogue is parsed as annotation text, so an entry
phrased unusually can be miscounted; improved_by in particular under-reports where it
uses “Refound” or prose.
Above