Skip to content

SUPERSEDED/NON-PORTABLE — uniform-cost contract pinned-ledger predecessor - #46

Closed
d6g8k5htny-coder wants to merge 1 commit into
claude/cover-outside-residual-guardfrom
claude/cover-uniform-cost-contract
Closed

d6g8k5htny-coder wants to merge 1 commit into
claude/cover-outside-residual-guardfrom
claude/cover-uniform-cost-contract

Conversation

@d6g8k5htny-coder

Copy link
Copy Markdown
Owner

Stacked on #38 (same file, same package) — merge that first, or retarget this to the migration branch once it lands. One file, one new control.

A number in three documents that nothing held

PolarRegion.uniform_cost answers RN5's "Treat the near-axis refinement cost explicitly", and research/cover/README.md stakes its standing on the distinction: "a count, not an estimate — exact rationals, no fit, no sampling." Its output is quoted as exact arithmetic in three places:

  • docs/OPEN_PROBLEMS.md §A5 — "98 × 629 = 61,642 polar cells"
  • docs/FINDINGS_2026-09-18.md
  • research/cover/README.md

Control 18 checked the types, that cells is the product, that the anisotropy is 50, and that a finer target costs more. None of that constrains the contract the docstring states — that the grid bounds the cell diameter by dr + r_hi·2π·dt ≤ target.

So this survived all 48 tests:

regions.py:323    half = target_diameter / 2   ->   half = target_diameter
published under the mutation
grid 98 × 629 49 × 315
cells 61,642 15,435
diameter bound vs target 1/10 0.0999458 ✓ 0.1997 ✗

The mutant grid does not cover at the resolution it claims, and every document quoting 61,642 becomes false. Nothing failed.

Control 43

Exact rationals throughout, never float. Asserts the headline bound at targets 1/10, 1/20 and 1/3; the even split by which it is achieved; each count minimal for its own half-budget; the published 98 / 629 / 61,642; and that the three documents still quote the figure — so prose and arithmetic cannot drift apart in either direction.

Verified against a copy under the scratchpad, never by editing the library: the mutation FAILS control 43 while control 18 still PASSES. That is the point — 18 was blind to it.

On minimality, because my first draft got it wrong

The proposal this came from said to assert minimality, and my first attempt asserted the joint kind. It failed, and the code was right:

uniform_cost splits the budget evenly and solves each axis against target/2, so each count is minimal for its half. The pair is not jointly minimal over all (n_r, n_t) meeting the combined bound — at target 1/3 the annulus reports 30 × 189 while 30 × 188 also satisfies it.

Spending less on one axis to spend more on the other is a different algorithm from the one the docstring describes, and a test may not quietly demand it. The control records that in place, so the weaker property does not later read as an oversight someone should "fix".

Verification

11/11 checkers rc=0
python3 -m pytest -q     1,928 passed, 1 skipped (575s)
tests/test_cover.py      51 passed (48 before #38, 50 after, 51 now)

What this does not establish

No mathematics. A cell count is a count: it certifies no cell of the program's actual cover, every integrand in this package remains a labelled reference, and D3-LEMMA-RN-UNIF Piece 1 and Piece 2 remain OPEN. Pinning a published figure to the arithmetic that produced it makes the figure checkable, not correct.

Second of fourteen survivors from the adversarial survey; ten remain.

🤖 Generated with Claude Code

https://claude.ai/code/session_01Cz7WZybv8znP64SpPj6sWY


Generated by Claude Code

`PolarRegion.uniform_cost` is this package's answer to RN5's "Treat the
near-axis refinement cost explicitly", and `research/cover/README.md` stakes
its standing on the distinction: "a count, not an estimate -- exact rationals,
no fit, no sampling". Its output is quoted as exact arithmetic in three places:
`docs/OPEN_PROBLEMS.md` A5 ("98 x 629 = 61,642 polar cells"),
`docs/FINDINGS_2026-09-18.md`, and the package README.

Control 18 checked the types, that `cells` is the product of the two step
counts, that the anisotropy is 50, and that a finer target costs more. None of
that constrains the contract the docstring states -- that the grid bounds the
cell diameter by `dr + r_hi*2*pi*dt <= target`. The published number was
pinned by nothing, and this survived all 48 tests:

    regions.py:323   half = target_diameter / 2  ->  half = target_diameter

Under it the annulus reports 49 x 315 = 15,435 cells rather than 61,642, and
the grid it describes has diameter bound 0.1997 against a target of 0.1: it
does not cover at the resolution it claims, and every document quoting 61,642
becomes false. Nothing failed.

Control 43 asserts, in exact rationals and never in float: the headline bound
at targets 1/10, 1/20 and 1/3; the even split by which it is achieved; each
count minimal for its own half-budget; the published 98 / 629 / 61,642; and
that the three documents still quote the figure, so prose and arithmetic
cannot drift apart in either direction.

ON MINIMALITY, because the first draft of this control asserted the wrong one
and failed: `uniform_cost` splits the budget EVENLY and solves each axis
against `target/2`, so each count is minimal FOR ITS HALF. The pair is NOT
jointly minimal over all (n_r, n_t) meeting the combined bound -- at target
1/3 the annulus reports 30 x 189 while 30 x 188 also satisfies it. Spending
less on one axis to spend more on the other is a different algorithm from the
one the docstring describes, and a test may not quietly demand it. The control
says so in place rather than leaving the weaker property to look like an
oversight.

Verified against a copy under the scratchpad, never by editing the library:
the mutation FAILS control 43 while control 18 still PASSES, which is the
whole point -- 18 was blind to it.

This establishes no mathematics. A cell count is a count; it certifies no
cell, and `D3-LEMMA-RN-UNIF` Piece 1 and Piece 2 remain OPEN.

11/11 checkers pass; 1,928 passed, 1 skipped.

Co-Authored-By: Claude <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Cz7WZybv8znP64SpPj6sWY

Copy link
Copy Markdown
Owner Author

TERMINAL CLEANUP following the recorded pin audit: this branch is stacked on the OUTSIDE-residual line and edits pinned ledger.py; the author explicitly classified it “not portable” and moved the uniform-cost assertion to an audit/test boundary. PR110 is the current compliant test-only 61,642 control. Close this predecessor unmerged; preserve history. Scientific effect NONE.

@d6g8k5htny-coder d6g8k5htny-coder changed the title Pin the uniform-cost contract, and the 61,642 three documents quote SUPERSEDED/NON-PORTABLE — uniform-cost contract pinned-ledger predecessor Sep 26, 2026
d6g8k5htny-coder pushed a commit that referenced this pull request Oct 21, 2026
Working records behind Claude017's 20-21 October work: post drafts,
verification scripts (verify_landed.py, runchecks.sh, real_shell.py,
check467.py) and logs for main#453, #455, #456, #466 and #467, query-#46,
Math-#470 and #493, the R2 replay check, the R81 read and the check-in with
dot. They are kept so that another agent can re-run the checks without this
session's context, following the standing living-knowledge direction
(main#419/6321304701). The posted GitHub comments stay canonical. Not for
merge. Credit 0. Scientific effect NONE.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_017Mi3hxjaxV45x6zo6o1ee3
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant