--- slug: every-edge-but-one-at-eleven passed: 2026-10-08 by: the assay line (research/assay-line/unit-distance-1009/), Codex fixer directed by claude-answering-alexeev-u22 (the unit-distance wave supervisor, who decided every finding after re-reading each WRONG source); source record by Codex (gpt-6.1-sol), checked by Codex checked: 322 confirmed: 305 wrong: 0 unverifiable: 0 observed: 17 stale: 0 --- Count notes: confirmed: 305 (302 CONFIRMED plus three true-page MINOR citation repairs). This pass implements the directing instance's four-item triage for Every Edge But One at Eleven at 5a634e5551. It retains the 301 CONFIRMED claims and 17 OBSERVED author records re-read by the Codex checker in research/assay-line/unit-distance-1009/every-edge-but-one-at-eleven/N2-codex.md, repairs the three MINOR citation entries after independently re-reading their pinned evidence, and records the publication finding as CONFIRMED with the triage's pre-publication reason and the limits of this pass's live requests. The page statements and figures need no changes; the three MINOR lines count as confirmed and each has a [fixed] finding below. ## Claims - CONFIRMED | 8 October 2026 | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/NOTICE.txt | [prose-00-01] NOTICE says "Artificial Wasteland, 8 October 2026"; frontmatter and article metadata agree. - CONFIRMED | So close that every edge can take a turn being the exception. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-01-01] README says "all 53,006 deletion verdicts". Every actual edge has a deletion entry. Recreated ledger checks and the smaller-block/vertex-deletion searches passed, with the earlier classification as a premise. - CONFIRMED | Some small graphs cannot be drawn with every edge exactly one unit long. | https://arxiv.org/html/1905.07829v3 | [prose-02-01] The paper defines "forbidden" and exhibits minimal forbidden graphs. Its abstract supplies a finite list of 74, so nonexistence of some unit-distance drawings is an actual theorem here. - CONFIRMED | Globus and Parshall classified the 74 minimal forbidden graphs on at most nine vertices | https://arxiv.org/abs/1905.07829 | [globus-nine] The abstract says "one of 74 so-called minimal forbidden graphs" for graphs "up to 9 vertices". Authors and scope match. - MINOR | the Artificial Wasteland added 324 on ten and now 2,833 on eleven. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run.json; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/earlier.g6 | [X1; project-ten-eleven] The page numbers are correct. The old source excerpt supported only 2,833. The source record now quotes F10_provenance.members = 324 from run-report.json and minimal = 2833 from run.json as separately labelled verbatim excerpts; the order-ten entries in earlier.g6 recount to 324. Counted as a confirmed MINOR citation repair. - CONFIRMED | Together these 3,231 graphs decide whether any graph on at most eleven vertices has a unit-distance drawing: it does exactly when none appears as a subgraph. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json; git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-02-03] The spec says "contains none of 3,231 graphs" and explicitly separates 74 through nine, 324 on ten, and 2,833 on eleven. This is the project's computer-assisted classification with its recorded premises, not an externally refereed theorem. Frozen reports and the pinned extractor agree. - CONFIRMED | All 2,833 eleven-vertex obstructions are drawn here with every edge at length one except one. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-02-04] README says "three exact-certificate edge-deletion drawings per graph". The full pinned verifier passed all 8,499 drawings, each with one specified cut edge and all remaining edges unit. - CONFIRMED | Hold a certified drawing, pull the last edge towards one and watch for two points merging, check its exact coordinates in your browser, or search a graph for a forbidden subgraph. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-02-05] The full app connects chooseDrawing, drag/pull, the drawing worker, and the injective containment search. "instrument.load(selected.n, selected.edges, drawing.xy, drawing.cut)" installs the selected certificate; exact calculations and containment were recreated from these modules. - CONFIRMED | Computer-assisted, and not yet refereed outside the project. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-02-06] README says "The result is computer-assisted and has not been refereed outside this project." The technical model reviews later on the page are expressly part of the project apparatus, so they do not contradict this qualification. - CONFIRMED | Cyan segments are constrained to unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/index.html | [prose-03-01] draw.mjs distinguishes "e-cut" from "e-unit", skips the cut in the solid-edge constraints, and sets stroke-dasharray only for the cut. The pinned stylesheet supplies the stated colours; the full verifier checks actual solid lengths. - CONFIRMED | The amber dashed segment is left out. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/index.html | [prose-03-02] draw.mjs distinguishes "e-cut" from "e-unit", skips the cut in the solid-edge constraints, and sets stroke-dasharray only for the cut. The pinned stylesheet supplies the stated colours; the full verifier checks actual solid lengths. - CONFIRMED | Point labels identify vertices, and crossings do not add vertices. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-03-03] draw.mjs sets each vertex tag with "t.textContent = String(i)". The vertex arrays contain only decoded graph vertices; line intersections do not create additional vertices. - CONFIRMED | The screen is rounded. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs; supplemented by git show 5a634e5551:research/every-edge-but-one-at-eleven/tools/extract.py | [prose-05-01] chooseDrawing passes drawing.xy to the screen. extract.py centres and rounds those coordinates, while certificateText uses host.field and host.coords for the exact representation. - CONFIRMED | This check uses the unrounded polynomial coordinates of the restored certificate drawing. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-05-02] The exact-check handler sends "{host, g6: selected.g6, drawing}" to the drawing worker, rather than instrument.P. engine.mjs then checks the mapped polynomial coordinates. All 8,499 such drawings passed. - CONFIRMED | These are verdicts in the final checker record. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-07-01] validateLedger requires "row.status !== 'minimal'" to be false and one deletion per reconstructed edge. The committed shard ledgers and sealed report carry these verdicts; the browser does not present them as fresh full embedding proofs. - MINOR | Entries with a drawing button have a certificate drawing included on this page. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [X2; prose-07-02] The page statement is correct. validateLedger checks deletion rows, while renderLedger in app.mjs:99-106 matches a drawing cut to the deletion edge and emits the button only when the matching variant exists. The source, excerpt and locator now name that implementation. The checker recreated all 8,499 associations. Counted as a confirmed MINOR citation repair. - CONFIRMED | Other entries retain their verdict and block evidence. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-07-03] validateLedger processes every deletion regardless of whether it is among the three selected drawings. For block entries it checks reconstructed "derived.blocks" and "derived.isolated". The complete 53,006-row inventory retains both kinds of evidence. - CONFIRMED | The drawings and live checks need JavaScript. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/index.html | [prose-09-01] The HTML loads app.mjs as a module; it supplies the drawing, event handlers and worker checks. The quoted noscript message accurately states this requirement. - CONFIRMED | The classification, tables and source links remain readable below. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/index.html | [prose-09-02] The static HTML itself contains the classification, two complete tables and source anchors below the noscript message. These sections do not require app.mjs to exist in the DOM. - CONFIRMED | A unit-distance graph asks for distinct points in the plane with every specified edge exactly one unit long. | https://arxiv.org/html/1905.07829v3 | [prose-10-01] The definition requires "distinct points" and edges that are "line segments of length 1" in the plane. These are precisely the page's length and distinctness requirements. - CONFIRMED | Unjoined pairs are free: they may also be one unit apart. | https://arxiv.org/html/1905.07829v3 | [prose-10-02] The definition says "non-adjacent vertices are distance 1 apart" is allowed. The containment search therefore correctly preserves edges without requiring preservation of non-edges. - CONFIRMED | Edges may cross. | https://arxiv.org/html/1905.07829v3 | [prose-10-03] The source definition imposes distances and distinct vertices, with no prohibition on crossings. For example, two independent unit segments with endpoints (-1/2,0), (1/2,0), (0,-1/2), (0,1/2) satisfy that definition and cross. This conclusion follows from the definition. - CONFIRMED | This is a question about lengths and distinctness, not about drawing a graph without crossings. | https://arxiv.org/html/1905.07829v3 | [prose-10-04] The source definition imposes distances and distinct vertices, with no prohibition on crossings. For example, two independent unit segments with endpoints (-1/2,0), (1/2,0), (0,-1/2), (0,1/2) satisfy that definition and cross. This conclusion follows from the definition. - CONFIRMED | A minimal forbidden graph has no such placement, but every proper subgraph does. | https://arxiv.org/html/1905.07829v3 | [prose-11-01] The source says "each of its proper subgraphs is unit-distance" for a minimal forbidden graph; forbidden means the whole graph is not unit-distance. - CONFIRMED | The gallery borrows the convention of Every Edge But One: draw a certified placement after deleting an edge, then put that edge back as a dashed line. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [prose-11-02] The spec says "all its edges at unit length but one" and calls this "the sibling page's convention". The rendering adds the deleted edge with the cut class; the exact checker excludes that edge from its unit identities. - CONFIRMED | You can see what has been left unpaid. | https://arxiv.org/html/1905.07829v3; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-11-03] This refers to the visibly dashed omitted edge immediately described, not a separate external factual attribution. The source's proper-subgraph definition and the recreated exact cut-edge check support that literal content. - CONFIRMED | A graph on at most eleven vertices is a unit-distance graph if and only if it contains none of these 3,231 forbidden graphs. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json; git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-12-01] The spec says "contains none of 3,231 graphs" and explicitly separates 74 through nine, 324 on ten, and 2,833 on eleven. This is the project's computer-assisted classification with its recorded premises, not an externally refereed theorem. Frozen reports and the pinned extractor agree. - CONFIRMED | This computer-assisted result rests on Globus and Parshall's 74 through nine vertices and the project's 324 on ten. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json | [prose-12-02] The run report records "F10_provenance" with ""members": 324" and ""status": "COMPLETE"". The earlier file recounts 74 through nine plus 324 order-ten graphs; the current frozen profile is B11. - CONFIRMED | 74 + 324 + 2,833 = 3,231 | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run.json; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/earlier.g6; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/L11.g6 | [prose-13-01] Arithmetic redone: 74 + 324 + 2833 = 3231. The independently decoded earlier.g6 has 398 entries, of which 324 have order ten; L11.g6 has 2,833. - CONFIRMED | The finite classification answers which small networks can exist with these lengths. | https://arxiv.org/abs/1905.07829; supplemented by git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-14-01] The abstract gives the forbidden-subgraph criterion on up to nine vertices; the project reports extend the same finite criterion through eleven. This statement describes that limited question. - CONFIRMED | It does not answer the large-scale Erdős unit distance problem or determine how many colours the whole plane needs. | https://arxiv.org/html/1905.07829v3 | [prose-14-02] The source distinguishes "Several long-standing open problems" from its finite classification. Its discussion treats the unit-distance extremal and plane-colouring questions separately. A classification restricted to eleven vertices does not by itself answer either unrestricted problem. - CONFIRMED | All 2,833, with eleven vertices. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-15-01] The app loads all gallery records and decodes their graph6 strings. Recreated census gives ""eleven": 2833"; every decoded graph has eleven vertices. Filters change how many cards are shown, not the stored wall. - CONFIRMED | The dashed segment is the one omitted edge; its displayed length is measured from the drawing. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-15-02] wall() builds the card length from "g.measure.len"; stats computes dist on the omitted edge from g.xy. All default measured card values and 8,499 alternative values matched the source inventory. - CONFIRMED | Open any card to hold it and inspect its evidence. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-15-03] The gallery click handler calls "selectGraph(Number(button.dataset.index), true)"; that loads its certificate shard, three drawings, ledger and optional proof. Every stored card index matched its graph. - CONFIRMED | A picture with one missing edge only shows that particular smaller graph can be drawn. | https://arxiv.org/html/1905.07829v3 | [prose-17-02] The source definition quantifies over "each of its proper subgraphs". A certificate for a single edge deletion establishes only that particular proper subgraph; the text correctly warns about this logical limitation. - CONFIRMED | Minimality quantifies over every edge, and also over vertex deletions. | https://arxiv.org/html/1905.07829v3 | [prose-17-03] The same proper-subgraph definition includes edge and vertex deletions. The browser checker explicitly checks both, so the page has not substituted one example drawing for minimality. - CONFIRMED | Open the ledger above: every actual edge is reconstructed from the graph, and each deletion has its own verdict. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-17-04] validateLedger reconstructs actual edges from decodeG6(row.g6), rejects duplicate/missing entries, and compares every deletion with its actual child graph. The full replay passed all 53,006 entries. - CONFIRMED | Together these graphs have 53,006 edges. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-18-01] Recounted graph6 edge sum: 2*16 + 35*17 + 841*18 + 1859*19 + 96*20 = 53006. This agrees with the run report and all displayed rows. - CONFIRMED | The final checker tested every corresponding deletion: 50,402 were embedded by certificates and 2,604 by smaller blocks. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run.json | [prose-18-02] run.json says ""deletionsEmbedded":50402" and ""deletionsBlocks":2604". All shard ledger verdicts independently recount to those totals; 50402 + 2604 = 53006. - CONFIRMED | Three certificate drawings per graph are available here; the complete deletion verdict ledger is included. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-18-03] Every one of 2,833 records has exactly three supplied certificate drawings, making 8,499. Shards contain all 53,006 deletion entries, not just those selected drawings. Both inventories were replayed. - CONFIRMED | Two mechanisms settle the deletions. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-19-01] All deletion verdicts are exactly "embedded" or "blocks" in the shard records. They total 50,402 and 2,604 respectively; no third verdict category was needed in the published ledger. - CONFIRMED | A biconnected deletion has an accepted exact embedding record, sometimes inherited through an injective vertex map into a larger drawable graph. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [prose-19-02] The exact drawing check verifies distinct mapped points and an injective vertex map into an accepted host. Other embedded deletion verdicts remain accepted frozen records, as the page says. Their acceptance is not newly proved by the small browser extract. - CONFIRMED | A deletion with a cut vertex splits into blocks of at most ten vertices. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-19-03] blocksOf reconstructs connected biconnected blocks for each block verdict. The full replay found the stored block decompositions equal the actual deletions, with block orders at most ten. - CONFIRMED | Each block avoids the earlier forbidden list and embeds by the ten-vertex classification. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/audit-report.json | [prose-19-04] The search-enabled ledger checks verify no earlier forbidden subgraph in every smaller block, using the 398-entry list. The drawing conclusion is conditional on the earlier ten-vertex classification, exactly as the page states. - CONFIRMED | Rotate the pieces about their shared points to keep the finitely many other points apart. | https://arxiv.org/html/1905.07829v3 | [prose-19-05] The source says a connected graph is unit-distance "if and only if each of its biconnected components is unit-distance". Rotating attached components avoids finitely many coincident pairs, providing the page's constructive explanation of that lemma. - CONFIRMED | Deleting a vertex leaves a ten-vertex graph that still avoids the earlier list, so that too is drawable. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/audit-report.json | [prose-20-01] The full ledger check removes every vertex and searches the resulting ten-vertex graph against the earlier forbidden list. All searches passed. Its drawability then follows from the earlier classification premise. - CONFIRMED | Any proper subgraph is contained in an edge or vertex deletion. | https://arxiv.org/html/1905.07829v3 | [prose-20-02] From the source's "proper subgraphs" definition: a proper subgraph either omits a vertex or retains all vertices and omits an edge. It is a subgraph of the corresponding tested deletion. Restricting an embedding preserves distances and distinctness. - CONFIRMED | That is the logical step from a ledger of edge deletions to a minimal obstruction. | https://arxiv.org/html/1905.07829v3 | [prose-20-03] From the source's "proper subgraphs" definition: a proper subgraph either omits a vertex or retains all vertices and omits an edge. It is a subgraph of the corresponding tested deletion. Restricting an embedding preserves distances and distinctness. - CONFIRMED | And what if the numerical pull reaches one? | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-21-01] This is a question introducing the next solver limitations, not an additional positive assertion that a unit-distance solution exists. The following source-backed cases explain the possible numerical outcomes. - CONFIRMED | It may sacrifice a solid edge, or merge two points. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-21-02] The solver monitors all-edge residuals and all point gaps without imposing an exact distinctness certificate. copy.mjs selects the collision/solid-error ending from those stats. These are permitted numerical outcomes, not claims of an actual exact embedding. - CONFIRMED | Even a stall with separated points is only a local failure of the solver. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-21-03] draw.mjs stops after finite frames or a stall as well as after a small residual; it is a local finite-precision search. It does not exhaust all placements or prove nonexistence. - CONFIRMED | Its largest length error and closest point pair stay visible. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-21-04] The app onChange handler updates the solid-edge error and minimum gap from stats after movements and pull steps. draw.mjs computes the maximum solid-edge departure and every point-pair distance. - CONFIRMED | The refutation certificate, rather than the pull animation, excludes all placements. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/blind-report.json | [prose-21-05] The numerical animation cannot certify all placements. The recorded refutation is the universal nonembedding argument; README expressly distinguishes the exact certificate computation from failed numerical attempts. - CONFIRMED | Choose the held graph, its drawn edge deletion, or the recorded survivor from the search for a sixty-ninth distance among twenty-four points. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/survivor.json | [prose-22-01] The app host presets choose the held graph, its actual cut-edge deletion, or survivor.g6. The stored survivor decodes to 24 vertices and 69 edges and contains a catalogue obstruction by an explicit injective map. - CONFIRMED | You can also enter a graph6 string. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-22-02] The host input is decoded with decodeG6; validation limits it to thirty vertices. The app then runs the same containment worker for user-supplied strings. - CONFIRMED | The search preserves edges; it does not require non-edges to remain non-edges. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-22-03] findSubgraph tests mapped host adjacency only where the pattern has an edge; the map is injective. It never tests that a pattern non-edge stays a host non-edge. Thus it tests subgraphs rather than induced subgraphs. - CONFIRMED | This circular layout shows adjacency. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-24-01] hostPicture chooses points by equally spaced cos/sin angles solely from vertex count, then draws decoded adjacency. Those coordinates are a circular graph layout. - CONFIRMED | Its segments do not represent unit distances. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-24-02] The circular layout is unrelated to the certificate coordinates and its radius is fixed at 125 screen units. It does not constrain its edge lengths to one. - CONFIRMED | For hosts through eleven vertices, a complete miss has the classification's force, subject to its recorded proof. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [prose-25-01] A complete containment search with no hit and host order <= 11 invokes the finite classification, with the recorded proof premises. This does not promise coordinates from the search itself. - CONFIRMED | For larger hosts, a miss says only that this catalogue found no obstruction. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [prose-25-02] The classification is only through eleven vertices. Its converse cannot be applied to a larger graph avoiding this finite catalogue; the app uses the weaker text in that branch. - CONFIRMED | A budget-limited search reports its unfinished cases. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/check-worker.mjs | [prose-25-03] The worker increments "result.exhausted" when individual or total visit budgets run out; the app reports those unfinished patterns instead of claiming a complete miss. - CONFIRMED | A hit always supplies a vertex map you can inspect. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-25-04] Every found hit stores "{g6: pattern, map: found.map}". hostPicture highlights the same mapped vertices and the text prints an injective edge-preserving map. - CONFIRMED | The browser decodes the graph6 strings and rebuilds both tables. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-26-01] The app census calls decodeG6 for gallery and earlier entries, then builds the edge/order tables from the derived byEdges and byOrder objects. All recreated table values matched. - CONFIRMED | OEIS A308349 | https://oeis.org/A308349/internal | [oeis-earlier-citation] OEIS gives "%S 0,0,0,1,1,1,3,13,55" and calls these the numbers of minimal forbidden subgraphs for unit-distance graphs on n vertices. This is the earlier sequence through nine, not a published ten- or eleven-vertex term. - CONFIRMED | OEIS A308349 is the earlier sequence | https://oeis.org/A308349/internal | [oeis-earlier-sequence] OEIS gives "%S 0,0,0,1,1,1,3,13,55" and calls these the numbers of minimal forbidden subgraphs for unit-distance graphs on n vertices. This is the earlier sequence through nine, not a published ten- or eleven-vertex term. - CONFIRMED | the eleven-vertex term here is the project's computation. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run.json | [eleven-is-project-term] The sealed run and L11.g6 supply the order-eleven count; OEIS A308349 ends at nine in the fetched source. The page expressly identifies 2,833 as a project computation. - CONFIRMED | The recorded enumeration starts with 900,969,091 biconnected graphs on eleven vertices. | https://oeis.org/A002218/internal | [prose-27-01] OEIS A002218 is the biconnected graph count sequence; its n=11 term is "900969091" with offset 1. The frozen run independently records the same raw_biconnected count. - CONFIRMED | Of those, 448,708 avoid the 398 earlier obstructions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json | [prose-27-02] run.json says ""inputs":448708". The audit report independently records ""B11": 448708" and ""distinct_iso_classes": 448708" in its input object. The full enumeration is recorded, not rerun in this pass. - CONFIRMED | Certificates decide 443,444 as drawable and 5,264 as forbidden, with 0 undecided. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json | [prose-27-03] The frozen reports give ""embedded":443444", ""refuted":5264", and ""unknown":0". Arithmetic redone: 443444 + 5264 = 448708. - CONFIRMED | The deletion test keeps 2,833 minimal graphs and rejects 2,431 non-minimal ones. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json | [prose-27-04] The frozen report and independently recounted list give 2,833 minimal plus 2,431 nonminimal: 2833 + 2431 = 5264. The audit report records that partition separately. - CONFIRMED | The funnel is a list of recorded stages, not an area-scaled chart. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-28-01] The funnel renders recorded values as separately labelled stages; their CSS widths are not proportional to the numbers. It accurately disclaims an area-scaled numerical encoding. - CONFIRMED | OEIS A002218 | https://oeis.org/A002218/internal | [oeis-biconnected-citation] The fetched OEIS sequence contains "900969091" as its eleventh term, with offset 1; the frozen run gives ""raw_biconnected":900969091". The attribution and number match. - CONFIRMED | The raw biconnected count agrees with OEIS A002218 | https://oeis.org/A002218/internal | [raw-count-agreement] The fetched OEIS sequence contains "900969091" as its eleventh term, with offset 1; the frozen run gives ""raw_biconnected":900969091". The attribution and number match. - CONFIRMED | the retained candidates and verdicts come from the sealed run. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json | [retained-run-source] The run report records the sealed B11 inputs and verdicts with hashes; the numerical funnel copies those figures. It does not attribute retained candidates or final certificates to OEIS. - OBSERVED | After the automated stages, 503 hard cases remained. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/campaign-evidence.txt | [prose-29-01] campaign-evidence.txt records "503 of 503 ACCEPTED" and "remaining 0" for the analyst campaign after the automated residue. This supports the recorded event; the full campaign was not repeated. - OBSERVED | Claude analysts and Codex produced checked certificates for them. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/campaign-evidence.txt | [prose-29-02] The campaign record names Claude analyst queues and "A second Codex consult", describes the imported returns and records their acceptance. This is checked against the committed event record. - OBSERVED | The last, packet 0062, needed a 187-row derivation ending in a positive constant plus 193 weighted squares. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/campaign-evidence.txt | [prose-29-03] The committed event record says "187 rows, 7,016,965 bytes, SOS leaf c = 1 (193 squares)" for packet 0062. Constant 1 is positive; the stated row and square counts match. - OBSERVED | Its 7,016,965-byte record was constructed in a Codex consult and rebuilt byte for byte on a virtual machine. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/campaign-evidence.txt | [prose-29-04] The committed record says "Analyst c13 rebuilt it byte for byte on the VM" after the second Codex consult, and gives the hash and 7,016,965 bytes. This supports the historical claim without needing to repeat the consult. - CONFIRMED | Every certificate supplies either a construction or a contradiction. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [prose-30-01] README and the frozen reports distinguish accepted embedding constructions from algebraic/forced-edge refutations. The exact browser drawings and short refutations were independently rerun; the page disclaims replay of every full classification refutation. - MINOR | Some refutations add forced unit edges until a smaller obstruction appears. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/audit-report.json | [X3; prose-30-02] The old excerpt named the generator for twelve readable proofs whose forty terminal nodes are 25 collision and 15 length contradictions. The claim concerns the broader campaign; audit-report.json records refuted/tu = 1760 and refuted/sub = 1590. The source record now cites those audit counts. The frozen GP-10 verifier used by GP-11 adds gadget-forced edges before searching for a forbidden or refuted graph; its source digest agrees with run-report.json. These recorded counts do not claim a fresh replay of the full refutations. Counted as a confirmed MINOR citation repair. - CONFIRMED | Others combine polynomial equations into an impossible identity, or into an expression that must be both zero and strictly positive. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/hardest-metrics.json | [prose-30-03] The campaign record's "SOS leaf c = 1 (193 squares)" is a positive constant plus squares forced to vanish, hence a contradiction. The short logic checker also validates exact wrong-length or collision relations. These are constructions of algebraic contradictions, not numerical failures. - CONFIRMED | Long derivations expose each intermediate row to the checker. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/hardest-metrics.json | [prose-30-04] The frozen campaign records 187 intermediate rows for its hardest real-dag certificate. The audit and blind check accept the corresponding certificate families; README explains the row-by-row checker and the limits of the extract. - OBSERVED | The frozen checker then read the sealed assembly in one serial pass, taking 105,409 seconds. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/cost.json | [prose-31-01] cost.json says ""wall_seconds": 105408.82285383999", which rounds to 105,409. The serial frozen-checker run is a recorded event; it was not replaced by the much smaller extractor replay. - OBSERVED | Its final status was VERIFIED_B11. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/outcome.json | [prose-31-02] outcome.json says ""status": "VERIFIED_B11"". The run-report ACCEPT and the extractor PASS describe other stages, so those statuses do not contradict this event. - CONFIRMED | These are figures from the run record, not a classification recomputed by this page. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run.json | [prose-31-03] run.json and run-report.json retain frozen figures and input/artifact hashes. The app loads their data; its local census and limited checks do not enumerate all B11 graphs again. - CONFIRMED | These 2,833 networks of eleven points cannot have every link exactly one unit long, but removing any link makes that possible. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-34-01] The stored list has 2,833 order-eleven minimal obstructions and all corresponding deletion obligations. Exact drawing checks and complete smaller-block/vertex-deletion searches passed; nonembedding relies on the accepted frozen refutations and classification premises. - CONFIRMED | Open a drawing, drag its points, or check its exact coordinates. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-34-02] The app wires card selection, instrument drag handlers and the exact-check worker. All certificate values replay successfully; the actual live page cannot currently be fetched, which is recorded separately under publication availability. - CONFIRMED | This page cannot replay the full classification or turn a failed numerical search into a proof. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-34-03] The extract checks certificates/maps/ledgers, not the full sealed B11 computation. draw.mjs is a finite local solver. Both limitations follow from the actual programs as well as the README. - CONFIRMED | The full ledger recount is optional and loads the certificate shards. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-35-01] The optional audit-ledgers button reads every shard with shardFor and calls validateLedger. Initial load only reads the gallery/index/default shard; the full 53,006-entry recount is an explicit optional action. - CONFIRMED | Integer arithmetic checks squared distances as polynomial identities modulo the root polynomial. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-36-01] engine.mjs uses BigInt coefficients, polynomial reduction by minpoly, and squared-distance identities for every solid edge. The full verifier passed those checks on all 8,499 supplied drawings. - CONFIRMED | Rational interval arithmetic separates every pair of points using one common real-root interval. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [prose-36-02] The checker uses rational endpoints for one sign-changing root interval and checks a coordinate difference interval for every pair. It bisects if necessary. All 467,445 mapped point pairs across 8,499 drawings were separated. - CONFIRMED | The check applies to the restored certificate drawing even after you move the screen's points. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-36-03] The exact worker gets the stored host, map and drawing even after instrument coordinates change; it never substitutes moved screen points. chooseDrawing restores the original rounded display separately. - CONFIRMED | The browser measures every default drawing from its rounded coordinates. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-37-01] start() calls stats(g.xy, graph.edges, g.cut) on every default drawing. The recreated 2,833-default inventory matches every screen length and the aggregate measurements. - CONFIRMED | Exact certificates support their unrounded originals. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/extraction.json | [prose-37-02] Unrounded coordinates are polynomials in the stored algebraic field and accepted host data, independent of g.xy. The full exact replay confirms unit identities, cut departure and distinctness for each mapped drawing. - CONFIRMED | The floating measurements and the live drag solver use finite precision; the length error is reported rather than called zero. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-37-03] The floating solver and stats use Number arithmetic. The app prints finite residuals with tiny(worst) instead of printing an exact zero; the recreated maximum is 1.1470824290427117e-12. - CONFIRMED | For each graph, choose the three available embedded deletions with the largest minimum point separation. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/extraction.json | [prose-38-01] extract.py orders candidate embedded deletions by descending minimum pair gap, then uses cut-edge labels to break ties, and retains three. The pinned full verifier recomputes and validates all 8,499 selected drawings. - CONFIRMED | Ties use the edge labels. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/extraction.json | [prose-38-02] extract.py orders candidate embedded deletions by descending minimum pair gap, then uses cut-edge labels to break ties, and retains three. The pinned full verifier recomputes and validates all 8,499 selected drawings. - CONFIRMED | Translate the drawing to its centre and round it for the screen. | git show 5a634e5551:research/every-edge-but-one-at-eleven/tools/extract.py | [prose-38-03] extract.py translates each coordinate by its centre and rounds the screen copy, while preserving the original field coordinates and map. The generated coordinate/readout inventory matches. - CONFIRMED | This affects legibility, not which graph is forbidden or minimal. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/extraction.json | [prose-38-04] Translation and a separate rounded display do not change the source graph6, its frozen refutation or minimality ledger. Exact tests use the original coordinates, so the presentation choice does not alter those claims. - CONFIRMED | Containment tries the held graph and the recorded application first, then the catalogue. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [prose-38-05] The app creates an ordered pattern list beginning with the selected graph and the survivor's recorded obstruction, then appends the catalogue without duplicates. The worker traverses this supplied order. - CONFIRMED | The solver can settle into different local minima. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [prose-38-06] The pull algorithm is a local finite-precision relaxation with finite stopping rules. Different initial screen coordinates can produce different local outcomes; no uniqueness claim or exact success follows from it. - CONFIRMED | The full enumeration, every refutation, and the lower-order classification are not replayed here. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-39-01] README says "The full B11 enumeration and its long refutations are not replayed by this extract." The browser loads the earlier forbidden list as a premise and has only twelve short refutations. - CONFIRMED | The finite extract lets you check the drawings, maps, census, and deletion evidence. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-39-02] The full pinned verifier checks 8,499 exact drawings, their host maps, graph6 census and 53,006 deletion entries. Optional browser checks reconstruct labels/blocks and search smaller deletions; accepted general embedded verdicts remain recorded evidence. - CONFIRMED | The frozen run report records the larger computation; its ACCEPT flag alone is not a new proof. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json | [prose-39-03] The frozen report says ACCEPT and names hashed inputs/artifacts. An acceptance string by itself is not an independent reconstruction of the computation, a limitation the page expressly states. - OBSERVED | A separate audit re-derived the minimal list from the records alone and obtained byte-identical graph6 data. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/audit-report.json | [prose-40-01] The committed audit report records PASS, ""derived_list_valid": true" and ""L11": 2833" in its independently derived minimality. The spec says "the result is byte-identical". This is evidence for the separate audit event, not a rerun of the entire 3.39 GB census. - OBSERVED | A blind second verifier accepted all 5,264 refutations. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/blind-report.json | [prose-40-02] blind-report.json says ""ACCEPT": 5264", ""REJECT": 0", ""UNSUPPORTED": 0". The count includes all refuted graphs, not only the 2,833 minimal ones. - CONFIRMED | Both exact certificate checkers use the same written lemmas: a mistaken lemma could survive both. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-40-03] The independent audit and blind checker records rely on the same stated certificate formats/lemmas. Their implementation independence does not constitute independent proof of the shared lemmas; the page explicitly acknowledges this common premise. - OBSERVED | Numerical attacks tried 16,384 starts for each of the 2,833 forbidden graphs and found no embedding, while every deletion and matched drawable control used by that audit embedded. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/numerical-report.json | [prose-41-01] The report gives ""budget_per_graph": 16384", ""members": 2833", ""member_hits": []", and ""controls_all_found": true". Both matched control counts are 2,833. These are the report's chosen controls, not every one of 53,006 deletions. 2048 starts * 8 rounds = 16384. - CONFIRMED | This tests the search's behaviour; failure to find a drawing is not a proof. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/numerical-report.json | [prose-41-02] The finite numerical attack report is a search result, with a stated genuine-embedding rule and positive controls. A finite unsuccessful search cannot certify nonembedding; this limitation is correct. - OBSERVED | Without FLINT, another program tested 86,987 polynomial identities at three random points modulo each of two large primes. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/modp-report.json | [prose-42-01] The modular report records ""identities_per_point": 86987", ""points_per_prime": 3", two explicit primes and PASS. Its independent arithmetic route does not use FLINT; this is a checked recorded event. - CONFIRMED | All passed. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/modp-report.json | [prose-42-02] The report says ""status": "PASS"" for the modular identity evaluations. The page does not present this as PASS for root counts, signs or forcing lemmas. - CONFIRMED | Random evaluations can catch errors but do not replace exact identity checking. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/modp-report.json | [prose-42-03] Random finite-field evaluations can expose a wrong polynomial identity but are probabilistic and can miss it. The report and page both separate this from exact polynomial identity checking. - CONFIRMED | The modular test does not check root counts, selected-root signs, forcing lemmas or pointer containment. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/modp-report.json | [prose-44-01] The report's nonidentities_not_checked array names "Sturm root count", "selected-root signs/irreducibility", "TU forcing lemmas", and "sub-pointer containment/dependencies". This is the same excluded scope. - CONFIRMED | Fixed primes also miss a discrepancy deliberately divisible by both primes. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/modp-report.json | [prose-44-02] The stated two fixed primes cannot detect an integer polynomial discrepancy whose coefficients are all multiples of their product: its residue is zero in both fields. This follows directly from modular arithmetic. - CONFIRMED | Its role is to test the arithmetic by another route. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/modp-report.json | [prose-44-03] The modular report uses integer finite-field evaluations distinct from the exact arithmetic checker; its limitations restrict the conclusion to this additional arithmetic test. - CONFIRMED | The enumeration and its recounts share nauty's canonical labelling. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-45-01] The frozen enumeration and audit provenance both name nauty canonical graph labels. The page does not claim independence of their graph-isomorphism foundation. - CONFIRMED | The algebraic checks depend on their arithmetic implementations and on the certificate lemmas. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-45-02] Exact acceptance depends on the implementation of the algebraic field operations and the lemmas authorising each certificate type. The page accurately identifies these shared foundations instead of calling the checks independent of all assumptions. - OBSERVED | Technical reviews by Arturo, a Kimi model, and Cairn, OpenAI-assisted, read the new proof obligations and profile; those reviews are part of the project's apparatus. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/gates.json | [prose-45-03] gates.json says "Arturo (Kimi K3; waste-drop 0019 and 0020) and Cairn (OpenAI-assisted; the 0021 follow-up)" and records the new proof-obligation/profile review. It supports the names, model descriptions and limited review scope. - CONFIRMED | The independent checking programs are still ours. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-46-01] The audit, blind, numerical and modular programs and reports are all retained in the project apparatus. The page describes implementation independence while candidly retaining project ownership. - CONFIRMED | The eleven-vertex classification depends on the project's ten-vertex classification and Globus and Parshall's theorem. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [prose-46-02] The report identifies F10_provenance and the earlier obstruction hashes. earlier.g6 combines the 74 through nine with 324 on ten; the proof uses that list for block/vertex deletions. This dependence is explicit. - OBSERVED | Before the run, the project forecast about 3,000 minimal graphs, with a stated 95% range of 1,500 to 6,000. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/prediction.json | [prose-47-01] prediction.json says ""point":3000", ""low":1500", ""high":6000", ""level":95", ""registered_before_run":true" and retains the source row/hash. The historical registration is checked against that committed record. - CONFIRMED | The actual count, 2,833, falls inside that range. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run.json | [prose-47-02] Arithmetic redone: 1500 <= 2833 <= 6000. The point forecast is 3000; the page does not confuse that forecast with the actual count. - CONFIRMED | This is one registered prediction tested against one outcome; it does not establish the range's calibration. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/prediction.json | [prose-47-03] The committed prediction contains one forecast for this outcome. A single covered observation does not establish long-run 95% interval calibration; the page makes exactly this limitation. - CONFIRMED | Aidan Globus and Hans Parshall, Small unit-distance graphs in the plane | https://arxiv.org/abs/1905.07829 | [globus-citation] The arXiv abstract names "Aidan Globus, Hans Parshall" and "Small unit-distance graphs in the plane". Citation spelling and paper identity match. - CONFIRMED | first posted in 2019 | https://arxiv.org/abs/1905.07829 | [globus-first-2019] arXiv states "Submitted on 19 May 2019 (v1)" and last revised 24 May 2019 for v3. The page's first-posted year is correct. - CONFIRMED | supplied the classification through nine vertices. | https://arxiv.org/abs/1905.07829 | [globus-through-nine] The abstract expressly proves the criterion for "a graph on up to 9 vertices" with 74 minimal forbidden graphs, matching the credited scope. - OBSERVED | The project's ten-vertex extension and the convention of leaving one edge out were suggested in correspondence by a researcher. | git show 5a634e5551:memory/log.d/2026-09-25T2300Z-every-edge-but-one.md | [prose-49-04] The committed 25 September log records the neutral attribution "suggested in correspondence by a researcher" and describes the request to preserve that wording. The correspondence event is supported by the author's log; no private message is inferred or newly disclosed. - CONFIRMED | The eleven-vertex search carries that programme another step. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/survivor.json | [prose-50-01] The earlier recorded classification has 324 order-ten additions; this layer's frozen L11 list has 2,833 order-eleven additions and uses the same drawing convention. This is the described next step in the programme. - CONFIRMED | The wall is useful in its own right, and one of its obstructions excludes the final candidate for a sixty-ninth unit distance among twenty-four points. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/survivor.json | [prose-50-02] survivor.json decodes to 24 vertices and 69 edges. The full pinned verifier finds an injective edge-preserving map for its recorded order-eleven obstruction, whose refutation excludes the candidate. - CONFIRMED | That application needs the certificate for the one contained obstruction; it does not need the completeness of the whole catalogue. | git show 5a634e5551:research/the-sixty-ninth-distance/data/survivor-blind-FINAL.md | [prose-50-03] If one forbidden graph injects edge-preservingly into a host, restricting any hypothetical host embedding would embed the forbidden graph. The contradiction needs that one refutation and map, not a complete forbidden catalogue. - CONFIRMED | The exact embeddings on this page are generated by the project's certificate computation. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/extraction.json | [prose-51-01] The extract pulls exact host fields, coordinates and maps from accepted certificate records, then creates centred/rounded screen copies. No external coordinate dataset is the source of these exact host drawings. - CONFIRMED | Engel, Hammond-Lee, Su, Varga and Zsámboki's beam-search dataset | https://arxiv.org/abs/2406.15317 | [beam-dataset-citation] The primary abstract names "Peter Engel, Owen Hammond-Lee, Yiheng Su, Dániel Varga, Pál Zsámboki" and the beam-search paper. The five surnames and dataset attribution match. - CONFIRMED | supplies configurations and controls elsewhere in this wave | git show 5a634e5551:research/the-sixty-fifth-distance/data/RESULT-u23.txt | [beam-used-elsewhere] The wave specification identifies those configurations/controls as used by sibling work. The layer's own extract is generated from project certificate hosts, so the assertion is expressly about elsewhere in this wave. - CONFIRMED | no coordinates from that dataset are redistributed here. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [no-beam-coordinates] All published gallery coordinates are recreated from accepted project host coordinates and maps by extract.py; the full verifier validates them against those hosts. No imported beam-search coordinates appear in this generation route. - CONFIRMED | This layer's check imports and runs the very module this page runs. | git show 5a634e5551:research/every-edge-but-one-at-eleven/verify-every-edge-but-one-at-eleven.mjs | [prose-53-01] The pinned verifier imports the same public engine.mjs, draw.mjs, logic.mjs and copy.mjs used by app.mjs and its worker. It actually ran these modules and passed, confirming the claimed shared implementation. - OBSERVED | Not yet put to that test. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/final-gates.json; supplemented by git show 5a634e5551:scripts/check-placard.mjs:142; git grep -n every-edge-but-one-at-eleven 5a634e5551 -- research/verifier-independence | [prose-53-02] OBSERVED, limited to the placard's sitewide dependence/defect-sweep experiment. check-placard.mjs says "No dependence run yet" before emitting this sentence. final-gates.json instead records syntax/metadata gates and ""browserRelaunched": false"; it is not evidence about that experiment. No target sweep record was kept in the pinned verifier-independence corpus; the same search finds the tv-collatz control. This lack of a recorded experiment is not a false-observation finding. - CONFIRMED | It is published to read. | git show 5a634e5551:scripts/check-placard.mjs; git show 5a634e5551:public/checks/manifest.json; git show 5a634e5551:public/checks/research/every-edge-but-one-at-eleven/verify-every-edge-but-one-at-eleven.mjs; research/assay-line/unit-distance-1009/every-edge-but-one-at-eleven/triage.json | [X4; prose-53-03] REJECTED as a pre-publication reachability finding, as directed in the triage. The publication commit contains the layer and a byte-identical public verifier mirror, listed in the manifest; the shared placard generator supplies this sentence for a published entry not yet swept. This confirms its publication-commit scope, not a new measurement of current live availability. The supervisor re-checks the live URL after landing. This pass received identical HTTP 403 responses for both targets and both sibling controls, so those requests cannot establish live target availability. - OBSERVED | Whether it runs on its own has not been tested yet. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/final-gates.json; supplemented by git show 5a634e5551:public/checks/manifest.json; git show 5a634e5551:scripts/check-placard.mjs:241 | [prose-53-04] OBSERVED, referring to the empty-directory reader-bundle test, not the author's repository verifier. The pinned manifest lists the file but gives no runnable bundle; check-placard.mjs emits this exact sentence for published files never swept. final-gates.json is not a log of that isolation test. Per step 7, an unrecorded test is not evidence against the observation. - OBSERVED | Last verified 8 October 2026, when it was written. | git show 5a634e5551:research/every-edge-but-one-at-eleven/data/final-gates.json | [prose-54-01] The article and NOTICE carry 8 October 2026; final-gates.json records the final PASS, modules and unchanged public output. The precise historic wall-clock verification timestamp is not kept in that JSON. The date is an author observation checked against those committed records; this pass does not misclassify the missing timestamp as a false claim. - CONFIRMED | Boris Alexeev, Dustin G. Mixon and Hans Parshall, The Erdős unit distance problem for small point sets | https://arxiv.org/html/2412.11914v2 | [amp-citation] The primary document title is "The Erdős unit distance problem for small point sets" and its author block gives Boris Alexeev, Dustin G. Mixon and Hans Parshall. All three names and title match, including Parshall beyond the first two names in the excerpt. - CONFIRMED | asked about extending it to ten. | https://arxiv.org/html/2412.11914v2#S5 | [amp-ten-extension] Section 5 asks to "extend their result to unit-distance graphs on 10 vertices". The supplied complete raw HTML paragraph is present verbatim. The source tool's NOTFOUND is a markup/plain-text comparison error; the paragraph and the positive-control next section text were read directly. - CONFIRMED | Host graph in graph6 format, up to thirty vertices | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [host-order-limit] The app and engine enforce the up-to-thirty-vertex host limit before containment search, with graph6 decoding. This is a supported tool limit, not a classification claim through thirty vertices. - CONFIRMED | Host graph6: | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [certificate-host] certificateText prints the actual accepted host g6, injective map, ascending minpoly coefficients, sign-changing rational interval, and coordinate degree bound (minpoly degree minus one). All 8,499 finite coordinate displays match the source inventory; the exact checks validate their mapped fields. - CONFIRMED | Injective map from the selected labels: | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [certificate-map] certificateText prints the actual accepted host g6, injective map, ascending minpoly coefficients, sign-changing rational interval, and coordinate degree bound (minpoly degree minus one). All 8,499 finite coordinate displays match the source inventory; the exact checks validate their mapped fields. - CONFIRMED | Root polynomial, coefficients from constant to highest power: | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [certificate-polynomial] certificateText prints the actual accepted host g6, injective map, ascending minpoly coefficients, sign-changing rational interval, and coordinate degree bound (minpoly degree minus one). All 8,499 finite coordinate displays match the source inventory; the exact checks validate their mapped fields. - CONFIRMED | Sign-changing root interval: | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [certificate-root-interval] certificateText prints the actual accepted host g6, injective map, ascending minpoly coefficients, sign-changing rational interval, and coordinate degree bound (minpoly degree minus one). All 8,499 finite coordinate displays match the source inventory; the exact checks validate their mapped fields. - CONFIRMED | Degree bound: | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [certificate-degree-bound] certificateText prints the actual accepted host g6, injective map, ascending minpoly coefficients, sign-changing rational interval, and coordinate degree bound (minpoly degree minus one). All 8,499 finite coordinate displays match the source inventory; the exact checks validate their mapped fields. - CONFIRMED | Embedded certificate | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [embedded-ledger-label] renderLedger prints "Embedded certificate", "Embedded by blocks" or "Canonical deletion:" directly from the validated row. Every ledger label/graph string and reconstructed block value matches the 53,006-entry finite inventory. - CONFIRMED | Embedded by blocks | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [block-ledger-label] renderLedger prints "Embedded certificate", "Embedded by blocks" or "Canonical deletion:" directly from the validated row. Every ledger label/graph string and reconstructed block value matches the 53,006-entry finite inventory. - CONFIRMED | Canonical deletion: | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [canonical-ledger-label] renderLedger prints "Embedded certificate", "Embedded by blocks" or "Canonical deletion:" directly from the validated row. Every ledger label/graph string and reconstructed block value matches the 53,006-entry finite inventory. - CONFIRMED | Force unit edge | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [proof-unit-edge-label] proofNode/termHTML print each checked lemma edge and exact coefficient (a+b*w)/d. Recreated all 98 proof steps and 262 terms, with branch context and exact Q(w) arithmetic. - CONFIRMED | Coefficient (a+b*w)/d | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [proof-coefficient-label] proofNode/termHTML print each checked lemma edge and exact coefficient (a+b*w)/d. Recreated all 98 proof steps and 262 terms, with branch context and exact Q(w) arithmetic. - CONFIRMED | The standalone page has the full eleven-vertex wall, certified edge-deletion drawings, a live containment search and a visible account of its checks and limits. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [standalone-features] The HTML and six modules supply the wall, three drawings per graph, exact checker, containment worker and explicit limits. Full pinned replay passed those assets. Current live unavailability is a separate reader finding, not missing pinned implementation. - CONFIRMED | The smaller wall draws every minimal obstruction through ten vertices. | git show 5a634e5551:research/every-edge-but-one/README.md | [smaller-wall] The pinned sibling has the 398-entry wall through ten: 74 + 324. Its retained list and README support the linked description; its live page is also the HTTP-200 positive control for the target 404. - CONFIRMED | Here the same convention of leaving one edge out reaches eleven, with exact host maps and the complete deletion ledger. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [smaller-wall-maps] The current shards retain all 53,006 deletion entries and three mapped exact-host drawings for each eleven-vertex obstruction. The full replay validated those maps and the complete ledger. - CONFIRMED | One obstruction from this catalogue fits inside the lone candidate for a sixty-ninth distance among twenty-four points. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/survivor.json | [survivor-contains] The 24-vertex, 69-edge stored survivor has an injective edge-preserving copy of the cited catalogue obstruction. The full pinned verifier checks that explicit map. - CONFIRMED | That page replays its polynomial contradiction; this one places it among thousands of minimal alternatives. | git show 5a634e5551:research/the-sixty-ninth-distance/data/survivor-blind-FINAL.md | [survivor-polynomial] The sibling sixty-ninth-distance README/retained proof record describe and replay the survivor's polynomial contradiction. Here its contained obstruction occurs among 2,833 minimal order-eleven records; these are distinct scopes of evidence. - CONFIRMED | The search for a sixty-fifth distance reaches a survivor that avoids the smaller forbidden list and still fails by geometric relations. | git show 5a634e5551:research/the-sixty-fifth-distance/data/PROOF-AND-CHECKS.txt | [sixty-fifth-survivor] The sibling proof/check record retains the 23-vertex, 65-edge survivor, its avoidance of the smaller forbidden list and its geometric refutation. The layer correctly distinguishes that survivor from the separate 24-vertex application. - CONFIRMED | Here those relations refute small networks, while exact deletion drawings expose what each obstruction needs. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [small-relations] The twelve short proofs use exact triangle/rhombus relations, and all supplied deletion drawings pass exact unit/distinctness checks. This directly substantiates the comparison to the sibling geometric refutation. - CONFIRMED | The Moser spindle uses unit edges to force colours in a graph that can be drawn. | https://arxiv.org/html/1804.02385 | [moser-drawable] de Grey describes "a 4-chromatic unit-distance graph with 7 vertices" named the Moser spindle. Unit-distance means it has a drawing, while its edges force at least four colours; this matches the contrast on the page. - CONFIRMED | This wall asks whether a drawing exists at all, separating that geometric question from the colouring question. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [geometric-colouring] The present objects have accepted nonembedding refutations, whereas the Moser spindle is a drawable unit-distance graph with a colouring obstruction. Geometry and colouring ask different questions, as the source and graph definitions show. - CONFIRMED | The earlier enumeration excludes an extra distance among twenty-two points. | git show 5a634e5551:research/the-sixty-first-distance/README.md | [sixty-first-enumeration] The retained twenty-two-point enumeration record excludes the candidate for the sixty-first unit distance. The linked README and proof apparatus support this finite computer-assisted statement, not an assertion about all higher orders. - CONFIRMED | Small forbidden graphs supply filters for such enumerations; this page examines the obstructions themselves and the evidence for their minimality. | https://arxiv.org/html/2412.11914v2 | [small-forbidden-filters] AMP describes filtering combinatorial graphs against small forbidden unit-distance subgraphs. This is the precise use of the catalogue in the linked enumerations; the present layer instead exposes the obstruction and deletion records. - CONFIRMED | EdgesMinimal graphs162173518841191,8592096Total2,833 | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [edge-table] Independently decoded all L11.g6 strings: 16 edges -> 2; 17 -> 35; 18 -> 841; 19 -> 1859; 20 -> 96; sum 2833. The spec excerpt matches those values. Its separate parenthetical about OEIS through ten is inaccurate and reported below, without invalidating this edge table. - CONFIRMED | VerticesMinimal graphsSource41Globus and Parshall51Globus and Parshall61Globus and Parshall73Globus and Parshall813Globus and Parshall955Globus and Parshall10324GP-10112,833GP-11Through eleven3,231Combined | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md; supplemented by https://oeis.org/A308349/internal; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/earlier.g6 | [order-table] Decoded earlier.g6 plus L11.g6: orders 4..11 give 1,1,1,3,13,55,324,2833; total 3231. The table attributes ten to GP-10 and eleven to GP-11 correctly. The source excerpt's "OEIS A308349, through ten" overstates OEIS coverage; OEIS ends at nine. - CONFIRMED | 41Globus and Parshall51Globus and Parshall61Globus and Parshall73Globus and Parshall813Globus and Parshall955Globus and Parshall | https://oeis.org/A308349/internal | [through-nine-table-sequence] OEIS "%S 0,0,0,1,1,1,3,13,55" has the stated terms for n=4..9. These six counts sum to 74 and have the correct Globus/Parshall scope. - CONFIRMED | Pulling towards unit length with all edges constrained. The solid-edge error and point gap show what the solver sacrifices. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [pull-progress] Instrument.pull relaxes all edges including the cut, and onChange prints current solid-edge error and point gap. The text describes a numerical process and its losses, not a proof of a successful drawing. - CONFIRMED | The exact check uses the certificate, not moved screen points. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [screen-certificate] The exact-check handler passes stored host/map data. The moved points remain instrument.P, a separate screen state; the worker checks the original certificate. - CONFIRMED | Each coordinate is a polynomial in t, coefficients in ascending order. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [root-coordinates] Host coords are coefficient arrays for x(t) and y(t), evaluated with coefficients ascending in powers. The exact field implementation and all mapped displays agree. - CONFIRMED | solid edges are unit identities | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [exact-unit-identities] The integer field check reduces each solid squared-distance polynomial to the constant 1. All 8,499 drawing checks pass; the default held drawing has 17 such solid edges. - CONFIRMED | point pairs are separated on one real-root interval. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [exact-point-separation] Interval arithmetic certifies all 55 unordered point pairs in each eleven-vertex drawing on one shared real-root interval. The full replay checks 467445 = 8499 * 55 mapped pairs. - CONFIRMED | squared-distance polynomials are identically one | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [exact-unit-pairs] The checker tests squared-distance polynomials for all pairs modulo minpoly. The default drawing has 21 identically unit pairs, a superset of its 17 required solid edges; additional non-edge unit distances are allowed. - CONFIRMED | actual edges, each recorded once: | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [ledger-edge-once] validateLedger decodes the actual edge set, rejects repeats and missing entries, and gives one verdict per actual edge. All 53,006 deletion rows pass. - CONFIRMED | deletion entries reconstruct, canonical labels match by actual isomorphism, and every smaller block and vertex deletion avoids the earlier list | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [ledger-search-result] The search-enabled checker reconstructs actual child graphs, verifies canonical labels by isomorphism, derives their blocks, and searches blocks plus vertex deletions against the earlier list. All pinned checks passed. - CONFIRMED | with an injective edge-preserving map. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [containment-injective-result] The containment implementation returns an injective map preserving every pattern edge; the displayed mapped labels use that returned map. The survivor application's explicit map passes. - CONFIRMED | Moving the screen points does not alter that certificate. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [ready-certificate] Changing instrument.P does not modify host.coords, drawing.map or the field polynomial. Exact worker inputs remain the original certificate, as the app says. - CONFIRMED | Block decompositions have been reconstructed. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [ledger-reconstructed] validateLedger calls blocksOf on actual edge deletions and compares both block keys and isolated vertices with the stored evidence. All recorded decompositions matched. - CONFIRMED | The verdicts themselves come from the frozen checker. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run-report.json | [ledger-verdict-source] The browser checks row structure and reconstructs graph evidence; acceptance of each general embedded verdict is taken from the frozen computation. The text correctly distinguishes the two. - CONFIRMED | Accepted embedded verdicts still rely on the recorded certificates; this does not replay all of them. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [ledger-embedded-scope] The browser ledger check does not load/replay the complete classified embedding library. Its returned embedded counts validate ledger evidence and maps, while accepted general certificates remain the recorded foundation. - CONFIRMED | The dashed edge is not one. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [exact-dashed] The exact field/interval check certifies the cut squared-distance polynomial is separated from 1 at the selected common root interval. All 8,499 supplied cut edges pass; this is stronger than just their rounded screen lengths. - CONFIRMED | This checks the restored certificate drawing. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [exact-restored] The result is computed on stored host coordinates and selected injective map, not the mutable screen. Full exact replay verifies the same worker calculation. - CONFIRMED | The complete classification and longer refutations belong to the frozen computation, not to this small browser extract. | git show 5a634e5551:research/every-edge-but-one-at-eleven/README.md | [no-short-proof] Only twelve short refutations are supplied in proofs.json; the README explicitly excludes replay of the full B11 classification and long refutations by this extract. - CONFIRMED | Checked exactly in your browser | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [proof-checked] Recreated all twelve short proofs with logic.check in exact Q(w) arithmetic. All return ok=true; their displayed checked sentences and edge-deletion rejection counts match exactly. - CONFIRMED | The proof supposes every listed edge, including the dashed one, has length one. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [proof-all-edges] logic.check starts with the full selected edge set, including the edge that the drawing leaves dashed. This is necessary for a contradiction to the full obstruction; removing each edge makes that proof fail. - CONFIRMED | A unit four-cycle of distinct planar points is a rhombus, so opposite vertices have the same sum. | https://arxiv.org/html/1905.07829v3 | [proof-rhombus] The paper says "every 4-cycle forms a rhombus" for an embedded unit-distance graph. Its Lemma 1 gives the opposite-vertex-sum relation. Distinctness is explicitly required in the page and the lemma. - CONFIRMED | An equilateral triangle turns left or right. | https://arxiv.org/html/1905.07829v3 | [proof-triangle] The paper says "every 3-cycle forms an equilateral triangle". In an oriented complex plane its two reflected placements yield left and right rotations; both branches are checked except for the first global reflection freedom. - CONFIRMED | Every row adds those relations with exact coefficients (a,b,d) meaning (a+b*w)/d, where w = exp(i*pi/3). | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [proof-coefficients] logic.mjs defines exact arithmetic in Q(w), with "w^2 = w - 1" and rational triples parsed as (a+b*w)/d. All 262 displayed combination terms and 98 steps match actual checked proof nodes. - CONFIRMED | Reflection lets the first triangle turn left without loss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [proof-reflection] The checker rejects "mirror used after an orientation was fixed"; it allows global reflection only at the first triangle. That is precisely the stated without-loss condition. - CONFIRMED | Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/logic.mjs | [proof-two-orientations] The checker sets "['+1', '-1']" when mirror freedom is not available and rejects "split does not cover its cases". Every supplied split covers the required orientations. - CONFIRMED | Each amber length is measured from its coordinates. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [gallery-lengths] stats calculates the omitted-edge Euclidean distance directly from P. All default and alternative amber lengths in the finite inventory match these coordinate measurements. - CONFIRMED | This obstruction excludes a unit-distance placement of the host, subject to its refutation. | https://arxiv.org/html/1905.07829v3 | [host-map-drawability] A host embedding would restrict along an injective edge-preserving map to an embedding of the contained obstruction. Its accepted refutation forbids that; the stated qualification retains dependence on that refutation. - CONFIRMED | No obstruction was found in the completed work. This is not a classification miss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/check-worker.mjs | [budget-result] The worker records exhausted patterns/visits and the app takes a distinct budget-limited branch. The quoted wording does not assert a complete classification miss. - CONFIRMED | The classification says this host is drawable; the search does not supply its coordinates. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [small-host-converse] For a complete no-hit search with host order <= 11, the finite forbidden-subgraph theorem implies drawability. findSubgraph returns only containment evidence; it does not construct any drawing. - CONFIRMED | the classification gives no converse, so this does not establish drawability. | git show 5a634e5551:oversight/waves/2026-10-08-unit-distance/specs/every-edge-but-one-at-eleven.md | [large-host-limit] The theorem in the spec restricts the converse to at most eleven vertices. The app uses this weaker branch for larger hosts, correctly avoiding a drawability conclusion. - CONFIRMED | This recount does not replay every embedding certificate. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [ledger-recount-limit] audit-ledgers iterates shards and validateLedger rows, not the original complete classified embedding/refutation store. The full pinned verifier confirms the recount but does not expand its mathematical scope. - CONFIRMED | Every recorded block decomposition matches the actual graph deletion. Verdict acceptance remains recorded evidence. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [ledger-recount-blocks] The checker compares derived block keys and isolated vertices with every stored decomposition and throws "wrong block decomposition" on mismatch. All 2,604 block verdicts pass; acceptance remains frozen-record evidence. - CONFIRMED | Each is checked when opened. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [short-refutations-opened] renderProof calls checkProof immediately and attempts the same proof on each edge deletion. All twelve opened-proof outputs were recreated, including 219 rejected deletions. - CONFIRMED | The page does not recompute the full classification. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [live-no-classification] start() loads gallery, earlier list, run, proofs, survivor and L11; it does not enumerate all biconnected eleven-vertex graphs. The page accurately states this implementation limit. - CONFIRMED | A unit-distance drawing requires distinct points, so a collision cannot complete the drawing. | https://arxiv.org/html/1905.07829v3 | [pull-collision] The source definition explicitly requires "distinct points". A merged pair violates that condition even if every edge residual happens to be numerically tiny. - CONFIRMED | This numerical attempt is not a refutation. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/draw.mjs | [pull-local-scope] The finite local solver stops at a residual, stall or frame budget. Its failure neither explores all coordinates nor produces a universal algebraic contradiction; this limitation is correct. - CONFIRMED | Time limit reached; the check is unfinished. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [unfinished-time] work() terminates the worker at its timeout and rejects with the exact displayed sentence. It does not treat that exception as a completed mathematical check. - CONFIRMED | Cancelled; the check is unfinished. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [cancelled-check] work().cancel() terminates the worker and rejects with "Cancelled; the check is unfinished." Subsequent selection checks prevent a stale worker response from being reported as success. - CONFIRMED | This browser needs native gzip decompression to read the exact certificate shards. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [gzip-requirement] The gzip fetch helper explicitly requires DecompressionStream and pipes the response through "new DecompressionStream('gzip')". Certificate shards are gzip data, so this stated browser requirement is real. - CONFIRMED | Decoded now: 2,833 eleven-vertex graphs + 398 earlier = 3,231. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [live-decoded] Recreated decoded counts: eleven 2833, older 398, total 3231. The app's live readout formats those actual counts; it does not derive them from its own output transcript. - CONFIRMED | Actual edge sum: 53,006 deletion obligations. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [live-deletions] Recreated actual edge sum is 53006, both from all decoded edge counts and from distinct ledger entries. The displayed arithmetic agrees. - CONFIRMED | Measured all 2,833 default drawings: largest solid-edge error 1.15e-12; minimum point gap 0.258826; smallest dashed-edge departure from one 0.035369. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [live-measurements] Recreated all 2,833 default stats: maxSolidError=1.1470824290427117e-12, minPointGap=0.25882586068696434, minDashedDeparture=0.03536850746145048. App formatting gives exactly 1.15e-12, 0.258826 and 0.035369. - CONFIRMED | Short refutations included: 12. Each is checked when opened. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs | [live-short-count] proofs.json has exactly twelve entries. renderProof checks each on selection; all twelve passed and every corresponding edge deletion rejected the same proof. - CONFIRMED | Passed: 53,006 distinct deletion entries, 50,402 embedded and 2,604 by blocks. Every recorded block decomposition matches the actual graph deletion. Verdict acceptance remains recorded evidence. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs; supplemented by git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/run.json | [ledger-total-readout] Independent full ledger replay gives 53006 distinct deletion entries, 50402 embedded and 2604 blocks, with every block decomposition reconstructed. The cited census snippet only supplies edge totals; validateLedger and actual shards supply verdict splits. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 18 of 18 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-1] Recreated graph J???]OsBfb_: exact proof result {"ok":true,"leaves":2}; rejected on 18 of 18 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Orient triangle 0, 7, 10. Reflection lets the first triangle turn left without loss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1-1] Graph J???]OsBfb_, conditional branch root. Exact checked node: {"tri":[0,7,10],"mirror":true,"cases":["+1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 4, 6, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1-2] Graph J???]OsBfb_, conditional branch root/+1. Exact checked node: {"tri":[4,6,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 1 to 8 from edge 5 to 6 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1-3] Graph J???]OsBfb_, conditional branch root/+1/+1. Exact checked node: {"edge":[1,8],"via":[5,6],"zeta":"-1,0,1","comb":[[["T",0,7,10,1],"0,1,1"],[["R",0,7,1,10],"1,0,1"],[["T",4,6,9,1],"1,-1,1"],[["R",4,7,10,9],"0,-1,1"],[["R",5,8,10,9],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 1 and 2 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1-4] Graph J???]OsBfb_, conditional branch root/+1/+1. Exact checked node: {"type":"collision","pair":[1,2],"comb":[[["R",2,8,3,10],"-1,0,1"],[["R",1,8,3,10],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 0 to 8 from edge 5 to 6 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1-5] Graph J???]OsBfb_, conditional branch root/+1/-1. Exact checked node: {"edge":[0,8],"via":[5,6],"zeta":"-1,0,1","comb":[[["T",0,7,10,1],"0,-1,1"],[["T",4,6,9,-1],"0,1,1"],[["R",4,7,10,9],"-1,1,1"],[["R",5,8,10,9],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 2 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1-6] Graph J???]OsBfb_, conditional branch root/+1/-1. Exact checked node: {"type":"collision","pair":[0,2],"comb":[[["R",2,8,3,10],"-1,0,1"],[["R",0,8,3,10],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 16 of 16 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-7] Recreated graph J??GhUgTF_?: exact proof result {"ok":true,"leaves":1}; rejected on 16 of 16 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Points 0 and 1 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-7-1] Graph J??GhUgTF_?, conditional branch root. Exact checked node: {"type":"collision","pair":[0,1],"comb":[[["R",0,8,2,10],"1,0,1"],[["R",2,7,4,8],"-1,0,1"],[["R",4,5,6,7],"1,0,1"],[["R",1,9,3,10],"-1,0,1"],[["R",3,6,5,9],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 19 of 19 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-8] Recreated graph J??GombZF__: exact proof result {"ok":true,"leaves":5}; rejected on 19 of 19 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Orient triangle 1, 9, 10. Reflection lets the first triangle turn left without loss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-1] Graph J??GombZF__, conditional branch root. Exact checked node: {"tri":[1,9,10],"mirror":true,"cases":["+1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 2, 9, 10. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-2] Graph J??GombZF__, conditional branch root/+1. Exact checked node: {"tri":[2,9,10],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 1 and 2 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-3] Graph J??GombZF__, conditional branch root/+1/+1. Exact checked node: {"type":"collision","pair":[1,2],"comb":[[["T",1,9,10,1],"0,-1,1"],[["T",2,9,10,1],"0,1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 6, 7. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-4] Graph J??GombZF__, conditional branch root/+1/-1. Exact checked node: {"tri":[3,6,7],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 4, 5, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-5] Graph J??GombZF__, conditional branch root/+1/-1/+1. Exact checked node: {"tri":[4,5,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 3 to 9 from edge 4 to 6 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-6] Graph J??GombZF__, conditional branch root/+1/-1/+1/+1. Exact checked node: {"edge":[3,9],"via":[4,6],"zeta":"-1,0,1","comb":[[["T",3,6,7,1],"0,-1,1"],[["R",4,5,7,6],"0,1,1"],[["T",4,5,9,1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 1 and 2 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-7] Graph J??GombZF__, conditional branch root/+1/-1/+1/+1. Exact checked node: {"type":"collision","pair":[1,2],"comb":[[["R",1,9,3,10],"1,0,1"],[["R",2,9,3,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 8 to 9 from edge 4 to 6 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-8] Graph J??GombZF__, conditional branch root/+1/-1/+1/-1. Exact checked node: {"edge":[8,9],"via":[4,6],"zeta":"-1,0,1","comb":[[["R",4,5,7,6],"1,-1,1"],[["T",3,6,7,1],"0,1,1"],[["R",3,6,8,7],"1,0,1"],[["T",4,5,9,-1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 2 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-9] Graph J??GombZF__, conditional branch root/+1/-1/+1/-1. Exact checked node: {"type":"collision","pair":[0,2],"comb":[[["R",0,8,9,10],"1,0,1"],[["R",2,8,9,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 4, 5, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-10] Graph J??GombZF__, conditional branch root/+1/-1/-1. Exact checked node: {"tri":[4,5,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 8 to 9 from edge 4 to 6 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-11] Graph J??GombZF__, conditional branch root/+1/-1/-1/+1. Exact checked node: {"edge":[8,9],"via":[4,6],"zeta":"-1,0,1","comb":[[["R",4,5,7,6],"0,1,1"],[["T",3,6,7,-1],"1,-1,1"],[["R",3,6,8,7],"1,0,1"],[["T",4,5,9,1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 2 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-12] Graph J??GombZF__, conditional branch root/+1/-1/-1/+1. Exact checked node: {"type":"collision","pair":[0,2],"comb":[[["R",0,8,9,10],"1,0,1"],[["R",2,8,9,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 3 to 9 from edge 4 to 6 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-13] Graph J??GombZF__, conditional branch root/+1/-1/-1/-1. Exact checked node: {"edge":[3,9],"via":[4,6],"zeta":"-1,0,1","comb":[[["T",3,6,7,-1],"-1,1,1"],[["R",4,5,7,6],"1,-1,1"],[["T",4,5,9,-1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 1 and 2 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-8-14] Graph J??GombZF__, conditional branch root/+1/-1/-1/-1. Exact checked node: {"type":"collision","pair":[1,2],"comb":[[["R",1,9,3,10],"1,0,1"],[["R",2,9,3,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 18 of 18 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-189] Recreated graph J?CgGtBkNC?: exact proof result {"ok":true,"leaves":1}; rejected on 18 of 18 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Force unit edge 0 to 8 from edge 3 to 4 with multiplier (a+b*w)/d = 1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-189-1] Graph J?CgGtBkNC?, conditional branch root. Exact checked node: {"edge":[0,8],"via":[3,4],"zeta":"1,0,1","comb":[[["R",0,9,2,10],"1,0,1"],[["R",2,5,6,10],"-1,0,1"],[["R",3,7,8,9],"-1,0,1"],[["R",4,5,6,7],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 1 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-189-2] Graph J?CgGtBkNC?, conditional branch root. Exact checked node: {"type":"collision","pair":[0,1],"comb":[[["R",0,8,6,10],"1,0,1"],[["R",1,8,6,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 20 of 20 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-397] Recreated graph J?Oak_xjEM?: exact proof result {"ok":true,"leaves":6}; rejected on 20 of 20 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Orient triangle 0, 7, 10. Reflection lets the first triangle turn left without loss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-1] Graph J?Oak_xjEM?, conditional branch root. Exact checked node: {"tri":[0,7,10],"mirror":true,"cases":["+1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 1, 6, 10. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-2] Graph J?Oak_xjEM?, conditional branch root/+1. Exact checked node: {"tri":[1,6,10],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 2, 5, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-3] Graph J?Oak_xjEM?, conditional branch root/+1/+1. Exact checked node: {"tri":[2,5,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 2 to 3 from edge 5 to 6 with multiplier (a+b*w)/d = 1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-4] Graph J?Oak_xjEM?, conditional branch root/+1/+1/+1. Exact checked node: {"edge":[2,3],"via":[5,6],"zeta":"1,0,1","comb":[[["T",2,5,9,1],"0,-1,1"],[["R",3,6,10,7],"-1,0,1"],[["T",0,7,10,1],"1,-1,1"],[["R",0,9,5,10],"0,-1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 2 to 7 from edge 0 to 9 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-5] Graph J?Oak_xjEM?, conditional branch root/+1/+1/+1. Exact checked node: {"edge":[2,7],"via":[0,9],"zeta":"-1,0,1","comb":[[["T",2,5,9,1],"0,-1,1"],[["T",0,7,10,1],"1,-1,1"],[["R",0,9,5,10],"1,-1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 2 and 8 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-6] Graph J?Oak_xjEM?, conditional branch root/+1/+1/+1. Exact checked node: {"type":"collision","pair":[2,8],"comb":[[["R",2,7,3,8],"1,0,2"],[["R",2,3,7,8],"1,0,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 7, 8. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-7] Graph J?Oak_xjEM?, conditional branch root/+1/+1/-1. Exact checked node: {"tri":[3,7,8],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 0 to 7 must have squared length 1/4 times that of unit edge 1 to 4, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-8] Graph J?Oak_xjEM?, conditional branch root/+1/+1/-1/+1. Exact checked node: {"type":"length","edge":[0,7],"via":[1,4],"zeta":"0,1,2","comb":[[["T",0,7,10,1],"1,-2,2"],[["T",3,7,8,1],"0,1,2"],[["R",3,6,10,7],"1,0,2"],[["T",1,6,10,1],"-1,1,2"],[["R",0,9,5,10],"1,-1,2"],[["T",2,5,9,-1],"1,0,2"],[["R",2,8,4,9],"0,1,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 2 to 8 must have squared length 3/1 times that of unit edge 0 to 7, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-9] Graph J?Oak_xjEM?, conditional branch root/+1/+1/-1/-1. Exact checked node: {"type":"length","edge":[2,8],"via":[0,7],"zeta":"2,-1,1","comb":[[["T",2,5,9,-1],"-1,1,1"],[["T",0,7,10,1],"0,1,1"],[["R",0,9,5,10],"-1,1,1"],[["T",3,7,8,-1],"-1,0,1"],[["R",3,6,10,7],"0,-1,1"],[["T",1,6,10,1],"0,1,1"],[["R",1,6,5,10],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 2, 5, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-10] Graph J?Oak_xjEM?, conditional branch root/+1/-1. Exact checked node: {"tri":[2,5,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 2 to 3 from edge 5 to 6 with multiplier (a+b*w)/d = 1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-11] Graph J?Oak_xjEM?, conditional branch root/+1/-1/+1. Exact checked node: {"edge":[2,3],"via":[5,6],"zeta":"1,0,1","comb":[[["T",2,5,9,1],"0,-1,1"],[["T",0,7,10,1],"1,-1,1"],[["R",0,9,5,10],"0,-1,1"],[["R",3,6,10,7],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 2 to 7 from edge 0 to 9 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-12] Graph J?Oak_xjEM?, conditional branch root/+1/-1/+1. Exact checked node: {"edge":[2,7],"via":[0,9],"zeta":"-1,0,1","comb":[[["T",2,5,9,1],"0,-1,1"],[["T",0,7,10,1],"1,-1,1"],[["R",0,9,5,10],"1,-1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 2 and 8 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-13] Graph J?Oak_xjEM?, conditional branch root/+1/-1/+1. Exact checked node: {"type":"collision","pair":[2,8],"comb":[[["R",2,7,3,8],"1,0,2"],[["R",2,3,7,8],"1,0,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 7, 8. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-14] Graph J?Oak_xjEM?, conditional branch root/+1/-1/-1. Exact checked node: {"tri":[3,7,8],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 2 to 8 must have squared length 3/1 times that of unit edge 0 to 7, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-15] Graph J?Oak_xjEM?, conditional branch root/+1/-1/-1/+1. Exact checked node: {"type":"length","edge":[2,8],"via":[0,7],"zeta":"2,-1,1","comb":[[["T",2,5,9,-1],"-1,1,1"],[["T",0,7,10,1],"0,1,1"],[["R",0,9,5,10],"-1,1,1"],[["T",3,7,8,1],"-1,0,1"],[["R",3,6,10,7],"-1,1,1"],[["T",1,6,10,-1],"1,-1,1"],[["R",1,6,5,10],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 0 to 7 must have squared length 1/4 times that of unit edge 1 to 4, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-397-16] Graph J?Oak_xjEM?, conditional branch root/+1/-1/-1/-1. Exact checked node: {"type":"length","edge":[0,7],"via":[1,4],"zeta":"0,1,2","comb":[[["T",0,7,10,1],"1,-2,2"],[["T",3,7,8,-1],"0,1,2"],[["R",3,6,10,7],"-1,1,2"],[["T",1,6,10,-1],"1,0,2"],[["R",0,9,5,10],"1,-1,2"],[["T",2,5,9,-1],"1,0,2"],[["R",2,8,4,9],"0,1,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 20 of 20 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-510] Recreated graph J?`ad_kEmM?: exact proof result {"ok":true,"leaves":14}; rejected on 20 of 20 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Orient triangle 0, 7, 10. Reflection lets the first triangle turn left without loss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-1] Graph J?`ad_kEmM?, conditional branch root. Exact checked node: {"tri":[0,7,10],"mirror":true,"cases":["+1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 1, 5, 10. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-2] Graph J?`ad_kEmM?, conditional branch root/+1. Exact checked node: {"tri":[1,5,10],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 1, 6, 10. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-3] Graph J?`ad_kEmM?, conditional branch root/+1/+1. Exact checked node: {"tri":[1,6,10],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 5 and 6 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-4] Graph J?`ad_kEmM?, conditional branch root/+1/+1/+1. Exact checked node: {"type":"collision","pair":[5,6],"comb":[[["T",1,5,10,1],"-1,1,1"],[["T",1,6,10,1],"1,-1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 2, 5, 8. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-5] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1. Exact checked node: {"tri":[2,5,8],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 0 to 8 from edge 2 to 7 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-6] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/+1. Exact checked node: {"edge":[0,8],"via":[2,7],"zeta":"-1,0,1","comb":[[["T",0,7,10,1],"0,-1,1"],[["R",2,5,10,7],"0,1,1"],[["T",2,5,8,1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 0, 4, 8. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-7] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/+1. Exact checked node: {"tri":[0,4,8],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 1 to 4 from edge 0 to 10 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-8] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/+1/+1. Exact checked node: {"edge":[1,4],"via":[0,10],"zeta":"-1,0,1","comb":[[["T",0,4,8,1],"1,-1,1"],[["R",0,8,5,10],"1,-1,1"],[["T",1,5,10,1],"0,-1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 8 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-9] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/+1/+1. Exact checked node: {"type":"collision","pair":[0,8],"comb":[[["R",1,4,9,6],"-1,0,2"],[["R",1,5,10,6],"1,0,2"],[["R",0,4,9,8],"1,0,2"],[["R",0,8,5,10],"1,0,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 6, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-10] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/+1/-1. Exact checked node: {"tri":[3,6,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 5 and 6 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-11] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/+1/-1/+1. Exact checked node: {"type":"collision","pair":[5,6],"comb":[[["T",0,4,8,-1],"1,4,7"],[["R",0,8,5,10],"6,3,7"],[["R",0,4,9,8],"-5,1,7"],[["T",3,6,9,1],"5,-1,7"],[["R",3,6,10,7],"4,-5,7"],[["T",0,7,10,1],"1,4,7"],[["T",1,5,10,1],"-1,3,7"],[["R",1,5,10,6],"2,1,7"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 0 to 4 must have squared length 21/49 times that of unit edge 5 to 8, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-12] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/+1/-1/-1. Exact checked node: {"type":"length","edge":[0,4],"via":[5,8],"zeta":"-5,1,7","comb":[[["T",0,4,8,-1],"1,4,7"],[["R",0,4,9,8],"2,1,7"],[["T",3,6,9,-1],"-2,-1,7"],[["R",3,6,10,7],"1,-3,7"],[["T",0,7,10,1],"2,1,7"],[["T",1,5,10,1],"-1,3,7"],[["R",1,5,10,6],"2,1,7"],[["R",0,8,5,10],"4,2,7"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 6, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-13] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/-1. Exact checked node: {"tri":[3,6,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 0 to 9 from edge 3 to 7 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-14] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/-1/+1. Exact checked node: {"edge":[0,9],"via":[3,7],"zeta":"-1,0,1","comb":[[["T",0,7,10,1],"0,-1,1"],[["R",3,6,10,7],"0,1,1"],[["T",3,6,9,1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 0, 4, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-15] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/-1/+1. Exact checked node: {"tri":[0,4,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 6 to 9 must have squared length 21/9 times that of unit edge 1 to 5, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-16] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/-1/+1/+1. Exact checked node: {"type":"length","edge":[6,9],"via":[1,5],"zeta":"5,-1,3","comb":[[["T",0,4,9,1],"-2,1,3"],[["R",0,4,8,9],"1,1,3"],[["T",2,5,8,-1],"-1,-1,3"],[["R",2,5,10,7],"1,-2,3"],[["T",0,7,10,1],"1,1,3"],[["T",1,5,10,1],"1,1,3"],[["R",1,5,10,6],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 0 to 4 must have squared length 3/4 times that of unit edge 0 to 10, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-17] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/-1/+1/-1. Exact checked node: {"type":"length","edge":[0,4],"via":[0,10],"zeta":"1,1,2","comb":[[["R",0,4,8,9],"0,1,2"],[["T",2,5,8,-1],"0,-1,2"],[["R",2,5,10,7],"1,-1,2"],[["T",0,7,10,1],"0,1,2"],[["T",1,5,10,1],"0,1,2"],[["R",1,5,10,6],"1,0,2"],[["R",0,9,6,10],"1,0,2"],[["T",0,4,9,-1],"1,1,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 8 to 9 must have squared length 3/1 times that of unit edge 5 to 10, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-18] Graph J?`ad_kEmM?, conditional branch root/+1/+1/-1/-1/-1. Exact checked node: {"type":"length","edge":[8,9],"via":[5,10],"zeta":"1,1,1","comb":[[["T",2,5,8,-1],"1,0,1"],[["R",2,5,10,7],"0,1,1"],[["T",3,6,9,-1],"-1,0,1"],[["R",3,6,10,7],"0,-1,1"],[["T",1,5,10,1],"0,1,1"],[["R",1,5,10,6],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 1, 6, 10. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-19] Graph J?`ad_kEmM?, conditional branch root/+1/-1. Exact checked node: {"tri":[1,6,10],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 2, 5, 8. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-20] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1. Exact checked node: {"tri":[2,5,8],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 0 to 8 from edge 2 to 7 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-21] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/+1. Exact checked node: {"edge":[0,8],"via":[2,7],"zeta":"-1,0,1","comb":[[["T",0,7,10,1],"0,-1,1"],[["R",2,5,10,7],"0,1,1"],[["T",2,5,8,1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 0, 4, 8. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-22] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/+1. Exact checked node: {"tri":[0,4,8],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 6, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-23] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/+1/+1. Exact checked node: {"tri":[3,6,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 1 and 10 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-24] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/+1/+1/+1. Exact checked node: {"type":"collision","pair":[1,10],"comb":[[["T",0,4,8,1],"1,2,7"],[["R",0,8,5,10],"-1,5,7"],[["R",0,4,9,8],"2,-3,7"],[["T",1,5,10,-1],"-8,5,7"],[["T",3,6,9,1],"-2,3,7"],[["R",3,6,10,7],"1,2,7"],[["T",0,7,10,1],"-3,1,7"],[["R",1,5,10,6],"2,-3,7"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 5 to 8 must have squared length 21/9 times that of unit edge 1 to 5, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-25] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/+1/+1/-1. Exact checked node: {"type":"length","edge":[5,8],"via":[1,5],"zeta":"-1,-4,3","comb":[[["T",0,4,8,1],"-2,1,3"],[["R",0,4,9,8],"1,1,3"],[["T",3,6,9,-1],"-1,-1,3"],[["R",3,6,10,7],"1,-2,3"],[["T",0,7,10,1],"1,1,3"],[["T",1,5,10,-1],"-1,0,1"],[["R",1,5,10,6],"1,1,3"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 1 to 4 from edge 0 to 10 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-26] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/+1/-1. Exact checked node: {"edge":[1,4],"via":[0,10],"zeta":"-1,0,1","comb":[[["T",0,4,8,-1],"0,1,1"],[["R",0,8,5,10],"0,1,1"],[["T",1,5,10,-1],"-1,1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 8 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-27] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/+1/-1. Exact checked node: {"type":"collision","pair":[0,8],"comb":[[["R",1,4,9,6],"-1,0,2"],[["R",1,5,10,6],"1,0,2"],[["R",0,4,9,8],"1,0,2"],[["R",0,8,5,10],"1,0,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 6, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-28] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/-1. Exact checked node: {"tri":[3,6,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 0 to 9 from edge 3 to 7 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-29] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/-1/+1. Exact checked node: {"edge":[0,9],"via":[3,7],"zeta":"-1,0,1","comb":[[["T",0,7,10,1],"0,-1,1"],[["T",3,6,9,1],"-1,0,1"],[["R",3,6,10,7],"0,1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 0, 4, 9. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-30] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/-1/+1. Exact checked node: {"tri":[0,4,9],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 1 to 5 must have squared length 3/4 times that of unit edge 6 to 9, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-31] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/-1/+1/+1. Exact checked node: {"type":"length","edge":[1,5],"via":[6,9],"zeta":"2,-1,2","comb":[[["T",0,4,9,1],"1,-1,2"],[["R",0,4,8,9],"-1,0,2"],[["T",1,5,10,-1],"-1,0,2"],[["T",2,5,8,-1],"1,0,2"],[["R",2,5,10,7],"0,1,2"],[["T",0,7,10,1],"-1,0,2"],[["R",1,5,10,6],"2,-1,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 0 to 4 must have squared length 21/49 times that of unit edge 6 to 9, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-32] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/-1/+1/-1. Exact checked node: {"type":"length","edge":[0,4],"via":[6,9],"zeta":"-5,1,7","comb":[[["T",0,4,9,-1],"1,4,7"],[["R",0,4,8,9],"2,1,7"],[["T",2,5,8,-1],"-2,-1,7"],[["R",2,5,10,7],"1,-3,7"],[["T",0,7,10,1],"2,1,7"],[["T",1,5,10,-1],"2,1,7"],[["R",1,5,10,6],"-1,3,7"],[["R",0,9,6,10],"4,2,7"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 8 to 9 must have squared length 3/1 times that of unit edge 1 to 5, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-33] Graph J?`ad_kEmM?, conditional branch root/+1/-1/+1/-1/-1. Exact checked node: {"type":"length","edge":[8,9],"via":[1,5],"zeta":"-1,-1,1","comb":[[["T",1,5,10,-1],"-1,0,1"],[["T",2,5,8,-1],"1,0,1"],[["R",2,5,10,7],"0,1,1"],[["T",3,6,9,-1],"-1,0,1"],[["R",3,6,10,7],"0,-1,1"],[["R",1,5,10,6],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 5 and 6 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-510-34] Graph J?`ad_kEmM?, conditional branch root/+1/-1/-1. Exact checked node: {"type":"collision","pair":[5,6],"comb":[[["T",1,5,10,-1],"0,-1,1"],[["T",1,6,10,-1],"0,1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 18 of 18 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-563] Recreated graph J@?AZOSbN`?: exact proof result {"ok":true,"leaves":1}; rejected on 18 of 18 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Force unit edge 3 to 9 from edge 5 to 8 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-563-1] Graph J@?AZOSbN`?, conditional branch root. Exact checked node: {"edge":[3,9],"via":[5,8],"zeta":"-1,0,1","comb":[[["R",2,3,8,10],"-1,0,1"],[["R",1,6,4,7],"-1,0,1"],[["R",1,7,2,10],"1,0,1"],[["R",4,6,5,9],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 3 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-563-2] Graph J@?AZOSbN`?, conditional branch root. Exact checked node: {"type":"collision","pair":[0,3],"comb":[[["R",0,9,8,10],"1,0,1"],[["R",3,9,8,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 17 of 17 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-564] Recreated graph J@?A[YgTF_?: exact proof result {"ok":true,"leaves":1}; rejected on 17 of 17 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Edge 0 to 8 must have squared length 1/4 times that of unit edge 2 to 3, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-564-1] Graph J@?A[YgTF_?, conditional branch root. Exact checked node: {"type":"length","edge":[0,8],"via":[2,3],"zeta":"-1,0,2","comb":[[["R",0,7,4,8],"1,0,2"],[["R",4,6,5,7],"-1,0,2"],[["R",0,8,2,10],"1,0,2"],[["R",1,6,5,9],"1,0,2"],[["R",1,9,3,10],"-1,0,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 19 of 19 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-568] Recreated graph J@?G?{eono_: exact proof result {"ok":true,"leaves":5}; rejected on 19 of 19 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Orient triangle 0, 9, 10. Reflection lets the first triangle turn left without loss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-1] Graph J@?G?{eono_, conditional branch root. Exact checked node: {"tri":[0,9,10],"mirror":true,"cases":["+1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 1, 9, 10. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-2] Graph J@?G?{eono_, conditional branch root/+1. Exact checked node: {"tri":[1,9,10],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 1 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-3] Graph J@?G?{eono_, conditional branch root/+1/+1. Exact checked node: {"type":"collision","pair":[0,1],"comb":[[["T",0,9,10,1],"0,-1,1"],[["T",1,9,10,1],"0,1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 2, 3, 10. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-4] Graph J@?G?{eono_, conditional branch root/+1/-1. Exact checked node: {"tri":[2,3,10],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 4, 5, 7. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-5] Graph J@?G?{eono_, conditional branch root/+1/-1/+1. Exact checked node: {"tri":[4,5,7],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 4 to 9 from edge 5 to 8 with multiplier (a+b*w)/d = 1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-6] Graph J@?G?{eono_, conditional branch root/+1/-1/+1/+1. Exact checked node: {"edge":[4,9],"via":[5,8],"zeta":"1,0,1","comb":[[["T",2,3,10,1],"0,-1,1"],[["R",2,8,9,10],"-1,0,1"],[["R",3,7,4,10],"1,-1,1"],[["T",4,5,7,1],"1,-1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 1 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-7] Graph J@?G?{eono_, conditional branch root/+1/-1/+1/+1. Exact checked node: {"type":"collision","pair":[0,1],"comb":[[["R",0,9,4,10],"1,0,1"],[["R",1,9,4,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 6 to 8 must have squared length 1/4 times that of unit edge 6 to 9, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-8] Graph J@?G?{eono_, conditional branch root/+1/-1/+1/-1. Exact checked node: {"type":"length","edge":[6,8],"via":[6,9],"zeta":"1,0,2","comb":[[["T",4,5,7,-1],"0,1,2"],[["R",5,7,6,8],"1,0,2"],[["T",2,3,10,1],"0,1,2"],[["R",2,8,9,10],"1,0,2"],[["R",3,7,4,10],"-1,1,2"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 4, 5, 7. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-9] Graph J@?G?{eono_, conditional branch root/+1/-1/-1. Exact checked node: {"tri":[4,5,7],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Edge 6 to 9 must have squared length 4/1 times that of unit edge 4 to 5, contradicting its unit length. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-10] Graph J@?G?{eono_, conditional branch root/+1/-1/-1/+1. Exact checked node: {"type":"length","edge":[6,9],"via":[4,5],"zeta":"2,-2,1","comb":[[["T",4,5,7,1],"1,1,1"],[["R",5,7,6,8],"1,0,1"],[["T",2,3,10,-1],"-1,1,1"],[["R",2,8,9,10],"-1,0,1"],[["R",3,7,4,10],"0,1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 4 to 9 from edge 5 to 8 with multiplier (a+b*w)/d = 1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-11] Graph J@?G?{eono_, conditional branch root/+1/-1/-1/-1. Exact checked node: {"edge":[4,9],"via":[5,8],"zeta":"1,0,1","comb":[[["T",2,3,10,-1],"-1,1,1"],[["R",2,8,9,10],"-1,0,1"],[["R",3,7,4,10],"0,1,1"],[["T",4,5,7,-1],"0,1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 1 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-568-12] Graph J@?G?{eono_, conditional branch root/+1/-1/-1/-1. Exact checked node: {"type":"collision","pair":[0,1],"comb":[[["R",0,9,4,10],"1,0,1"],[["R",1,9,4,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 18 of 18 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-826] Recreated graph J@`@OcTB^C?: exact proof result {"ok":true,"leaves":2}; rejected on 18 of 18 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Orient triangle 2, 6, 10. Reflection lets the first triangle turn left without loss. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-826-1] Graph J@`@OcTB^C?, conditional branch root. Exact checked node: {"tri":[2,6,10],"mirror":true,"cases":["+1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Orient triangle 3, 7, 8. Both orientations are required. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-826-2] Graph J@`@OcTB^C?, conditional branch root/+1. Exact checked node: {"tri":[3,7,8],"mirror":false,"cases":["+1","-1"]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 0 to 5 from edge 4 to 9 with multiplier (a+b*w)/d = 1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-826-3] Graph J@`@OcTB^C?, conditional branch root/+1/+1. Exact checked node: {"edge":[0,5],"via":[4,9],"zeta":"1,0,1","comb":[[["R",0,4,6,10],"1,0,1"],[["R",5,8,7,9],"-1,0,1"],[["T",2,6,10,1],"1,0,1"],[["R",2,3,7,6],"1,-1,1"],[["T",3,7,8,1],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Force unit edge 8 to 10 from edge 2 to 3 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-826-4] Graph J@`@OcTB^C?, conditional branch root/+1/+1. Exact checked node: {"edge":[8,10],"via":[2,3],"zeta":"-1,0,1","comb":[[["R",2,3,7,6],"0,1,1"],[["T",2,6,10,1],"-1,0,1"],[["T",3,7,8,1],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 1 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-826-5] Graph J@`@OcTB^C?, conditional branch root/+1/+1. Exact checked node: {"type":"collision","pair":[0,1],"comb":[[["R",1,5,8,10],"-1,0,1"],[["R",0,5,8,10],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 6 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-826-6] Graph J@`@OcTB^C?, conditional branch root/+1/-1. Exact checked node: {"type":"collision","pair":[0,6],"comb":[[["R",0,4,6,10],"1,0,1"],[["R",4,6,7,9],"1,0,1"],[["T",3,7,8,-1],"1,0,1"],[["R",3,7,9,8],"1,0,1"],[["T",2,6,10,1],"1,0,1"],[["R",2,3,7,6],"1,-1,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 18 of 18 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-1285] Recreated graph JG_?h`KBv`?: exact proof result {"ok":true,"leaves":1}; rejected on 18 of 18 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Force unit edge 1 to 4 from edge 5 to 6 with multiplier (a+b*w)/d = 1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1285-1] Graph JG_?h`KBv`?, conditional branch root. Exact checked node: {"edge":[1,4],"via":[5,6],"zeta":"1,0,1","comb":[[["R",1,2,10,8],"1,0,1"],[["R",2,7,3,10],"1,0,1"],[["R",3,6,9,7],"-1,0,1"],[["R",4,8,5,9],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 0 and 1 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-1285-2] Graph JG_?h`KBv`?, conditional branch root. Exact checked node: {"type":"collision","pair":[0,1],"comb":[[["R",0,4,8,10],"1,0,1"],[["R",1,4,8,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Checked exactly in your browser. The same proof is rejected on 18 of 18 edge deletions. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [short-proof-2392] Recreated graph JhIIc?B@Wp_: exact proof result {"ok":true,"leaves":1}; rejected on 18 of 18 actual edge deletions. The entire displayed readout matches the checked result. - CONFIRMED | Force unit edge 3 to 9 from edge 0 to 1 with multiplier (a+b*w)/d = -1,0,1. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-2392-1] Graph JhIIc?B@Wp_, conditional branch root. Exact checked node: {"edge":[3,9],"via":[0,1],"zeta":"-1,0,1","comb":[[["R",3,6,8,10],"1,0,1"],[["R",0,5,9,7],"1,0,1"],[["R",7,8,10,9],"1,0,1"],[["R",1,2,3,6],"-1,0,1"],[["R",2,3,10,4],"-1,0,1"],[["R",4,5,9,10],"-1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | Points 6 and 9 must coincide, violating distinctness. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [proof-step-2392-2] Graph JhIIc?B@Wp_, conditional branch root. Exact checked node: {"type":"collision","pair":[6,9],"comb":[[["R",3,6,8,10],"-1,0,1"],[["R",3,9,8,10],"1,0,1"]]}. Displayed vertices, relations, coefficient triples and conclusion match; this is a branch-local conclusion under the displayed orientations. - CONFIRMED | (added) No short proof is included for this graph. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs:157; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/data/proofs.json | [added-no-short-proof] Conditional result for the 2,821 catalogue graphs absent from the twelve-entry proof dictionary. The app uses this sentence only when !proof. Positive control: Graph 1 has a checked proof; Graph 2 does not. This is not a statement that no refutation exists. - CONFIRMED | (added) Passed exactly: 17 solid edges are unit identities; all 55 point pairs are separated on one real-root interval. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs:129; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [added-default-exact-counts] Default Graph 1, first drawing: reconstructed checkMappedDrawing returns solidUnit=17, pairs=55 and separated=55. These quantitative values were absent from the source-record exact-result entries. All 8,499 drawings separate 55 pairs, giving 467,445 pair checks. - CONFIRMED | (added) Across all pairs, 21 squared-distance polynomials are identically one modulo the degree-4 root polynomial. | git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/app.mjs:129; git show 5a634e5551:public/strata/every-edge-but-one-at-eleven/engine.mjs | [added-default-unit-pairs] For the same default drawing, exact calculation gives unitPairs=21 and degree=4. This is a count of all unit-distance pairs, including permitted non-edges, not a claim that all 55 pairs are unit distance. The source record contains the identity template but omits these generated quantities. - OBSERVED | (added) Separation needed 0 bisections. | recreated: node audit-displays.mjs, using public/strata/every-edge-but-one-at-eleven/engine.mjs at 5a634e5551 | [added-default-bisections] Recreated the exact checker for default Graph 1, first drawing: ""subdivisions":0". This is a measured result for that selected certificate only; it is not a claim that every drawing needs zero bisections. ## Findings - [fixed] X1, project-ten-eleven: the source record omitted the ten-vertex premise. Added run-report.json's F10_provenance.members = 324 alongside run.json's minimal = 2833, with separately labelled verbatim excerpts and locators. The page numbers were already correct. - [fixed] X2, prose-07-02: replaced the validateLedger citation with app.mjs:99-106, where a matching drawing cut controls the drawing button. The page statement was already correct. - [fixed] X3, prose-30-02: replaced the short-proof generator citation with audit-report.json:70-72, which records the broader campaign's refuted/sub and refuted/tu counts. The page's campaign-level sentence was already correct.