Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
282 changes: 282 additions & 0 deletions research/bit589-boundary-adaptive-r659-seed05/EXPECTED.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,282 @@
{
"A_slots": [
2070,
2071
],
"B_slots": [
65,
819,
820,
822,
823
],
"base_commit": "bce54fb3f895cbe5cd4c0eb477c3afeed100190f",
"c": "1733427039589844234749/1000000000000000000000000",
"candidate_assignments": 20,
"examples": {
"better": [],
"illegal": [
[
2070,
598,
819,
598,
"A_upper_boundary"
],
[
2070,
598,
820,
598,
"A_upper_boundary"
],
[
2070,
598,
822,
598,
"A_upper_boundary"
],
[
2070,
598,
823,
598,
"A_upper_boundary"
],
[
2071,
598,
819,
598,
"A_upper_boundary"
],
[
2071,
598,
820,
598,
"A_upper_boundary"
],
[
2071,
598,
822,
598,
"A_upper_boundary"
],
[
2071,
598,
823,
598,
"A_upper_boundary"
]
],
"tie": [
[
2070,
501,
819,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
],
[
2070,
501,
820,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
],
[
2070,
501,
822,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
],
[
2070,
501,
823,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
],
[
2071,
501,
819,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
],
[
2071,
501,
820,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
],
[
2071,
501,
822,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
],
[
2071,
501,
823,
598,
"-3/3906250000000000000000000000",
"3/3906250000000000000000000000"
]
],
"unresolved": [],
"worse": [
[
2070,
501,
819,
501,
"30336009189840886151104061/15625000000000000000000000000",
"6067201837968177230220817/3125000000000000000000000000"
],
[
2070,
501,
820,
501,
"30336009189840886151104061/15625000000000000000000000000",
"6067201837968177230220817/3125000000000000000000000000"
],
[
2071,
501,
819,
501,
"30336009189840886151104061/15625000000000000000000000000",
"6067201837968177230220817/3125000000000000000000000000"
],
[
2071,
501,
820,
501,
"30336009189840886151104061/15625000000000000000000000000",
"6067201837968177230220817/3125000000000000000000000000"
]
]
},
"home_control_profile": {
"1": 1323,
"2": 1342,
"3": 79,
"4": 44,
"5": 102,
"6": 11,
"7": 19
},
"illegal_A_upper_boundary": 8,
"joint_only_assignments": 0,
"literal_replay": [
{
"A": [
2070,
501
],
"B": [
819,
501
],
"profile": {
"1": 1322,
"2": 1343,
"3": 79,
"4": 45,
"5": 101,
"6": 11,
"7": 19
}
},
{
"A": [
2070,
501
],
"B": [
819,
598
],
"profile": {
"1": 1323,
"2": 1342,
"3": 79,
"4": 44,
"5": 102,
"6": 11,
"7": 19
}
},
{
"A": [
2070,
501
],
"B": [
820,
501
],
"profile": {
"1": 1322,
"2": 1343,
"3": 79,
"4": 45,
"5": 101,
"6": 11,
"7": 19
}
}
],
"literal_replay_count": 12,
"object": "PR589 fixed word; jointly boundary-adaptive A[2071] and B[820] at r=659",
"predecessor_fixed_pair_pr1382_head": "cf17b06c00c50a22315f210c5f6b5197c860abdd",
"predecessor_pr1345_head": "b54a856aa79857d91cd5d65f8f7144e26c8c084f",
"registers_touched": [
184,
290,
659
],
"relaxed_boundary_negative_control": [
2070,
1,
65,
0,
"A_upper_boundary"
],
"relaxed_boundary_negative_control_frames": [
{
"index": 1,
"mask_hex": "0x7fffffffffffffffffffffffffff",
"rank": 8
},
{
"index": 0,
"mask_hex": "0x0",
"rank": 0
}
],
"seed": 5,
"static_fixed_boundary_assignments": 12,
"tie": 8,
"track": "bit supplier",
"valid_assignments": 12,
"worse": 4
}
98 changes: 98 additions & 0 deletions research/bit589-boundary-adaptive-r659-seed05/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,98 @@
# PR589 jointly boundary-adaptive pair at register 659 (seed 5)

**Status: scoped negative-result audit. No new kappa or stronger bound is claimed.**

## Scope and result

The assigned OS-random seed was `5` (bit supplier). The three candidates and
selection rule are recorded in [SELECTION.md](SELECTION.md). Seed mapping chose
the third register among the top three ranked by `dim(firstB)-dim(lastA)` and
then register ID descending: shared register `r=659`, with A[2071]
`(frame 501, target 290, source 659)` and B[820]
`(frame 598, target 184, source 659)`.

This extends the exact fixed-option pair census in PR #1382 by restoring the
reciprocal boundary dependency for these two moves. For every exact commutation
slot region, the enumerator first relaxes the opposite-stage boundary to form a
finite candidate superset, then recomputes B's lower frame from the moved A
schedule, recomputes A's upper frame from the moved B schedule, and checks COPY
retention and the full D/A/B/C frame chain for registers 184, 290 and 659.

The exact census produced 20 candidate frame assignments. Eight fail the
reciprocal A upper boundary. Twelve are legal: 8 preserve the complete paid
profile and 4 are strictly worse; none improve and none remain unresolved. The
fixed-original-boundary control also yields 12 legal pairs, so the census found
no joint-only pair for this cut. All 12 legal pairs are replayed literally through `wlib.rebuild_C` and
`wlib.paid`; the baseline/home control reproduces the pinned word's paid
profile. Destination slots are gaps before original operation indices; the
literal replayer adjusts the insertion index after a pop for later moves. Exact witnesses and rational interval deltas
are in [EXPECTED.json](EXPECTED.json).

This is evidence only for one pair of operations in the pinned PR589 word. It
does not establish that boundary-adaptive options are redundant for other cuts,
other words, larger move sets or recursive constructions. The accepted selected
result remains #1094 and the current assembly remains complex-limited; this
result changes neither the selected certificate nor its inherited assumptions.

## Reproduce

From repository root, with Python 3.12 and the pinned source files in
[SOURCES.json](SOURCES.json), run the package verifier:

```sh
python3 research/bit589-boundary-adaptive-r659-seed05/verify.py
```

Expected result:

```text
PASS_BIT589_BOUNDARY_ADAPTIVE_R659 seed=5 candidates=20 valid=12 joint_only=0
```

For registered package metadata and source-pin validation:

```sh
python3 scripts/research_package.py --package research/bit589-boundary-adaptive-r659-seed05 --check-only
```

Expected result:

```text
PASS_PACKAGE_METADATA_AND_PINS (not a mathematical acceptance check)
```

The verifier takes about 15 seconds on the recorded environment. It uses only
the standard library and pinned PR589 word, `wlib.py`, and exact base-two moment
engine; `C=1733427039589844234749/10^24`. The atlas checks a deliberately
relaxed candidate rejected by the restored A boundary and confirms the
fixed-boundary domain is contained in the jointly legal set. The finite replay
is not a proof for unenumerated moves or other registers.

## Open next questions

The next scoped question is whether the same reciprocal-boundary enumeration
finds joint-only choices for the next seed-ranked high-gap register (r=660 or
r=67). First recheck overlap and derive its exact boundary operations. This
extension is not included here.

## Provenance and assumptions

The selected source is the PR589 bit supplier on PR #555, within the accepted
#1094 result. The exact move/price method follows the transport audit in
[PR #1345](https://github.com/CrocSwap/integer-mult-bounds/pull/1345); this
scoped extension follows the open next question recorded by
[PR #1382](https://github.com/CrocSwap/integer-mult-bounds/pull/1382). The
selection, current state and source pins are recorded in [TASK.json](TASK.json)
and [SOURCES.json](SOURCES.json). The selected certificate and task catalogue
are provenance; the listed word, `wlib.py`, and moment engine are live pinned
inputs.


## Credit and license

Prepared by Cinna Davis with substantial OpenAI Codex assistance. The verifier
adapts and credits the exact transport infrastructure developed in PR #1345
(Qwen3.8-Flash) and extends the fixed-option census contributed in PR #1382
(OpenAI Codex assisted). PR #589/#555 supply the bit word and its construction;
the selected #1094 result and the word's inherited assumptions remain unchanged.
New package material is Apache-2.0, consistent with repository policy.
Loading
Loading