Skip to content
Open
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
1 change: 1 addition & 0 deletions research/mixed-root-head-audit/.gitattributes
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
retained/** -text whitespace=cr-at-eol
40 changes: 40 additions & 0 deletions research/mixed-root-head-audit/CREDITS.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
# Credit and source boundary

Ali Romman prepared the separate character-evaluation audit, per-visit
certificate, occurrence accounting, proof and controls with substantial
OpenAI Codex assistance in research, implementation, verification and
writing. New material uses Apache-2.0. Separate implementations are not
independent human or formal-kernel acceptance.

Ali Romman, with substantial OpenAI Codex assistance, supplied the mixed
root, caller, view maps, price and review request in
[PR #7756](https://github.com/CrocSwap/integer-mult-bounds/pull/7756),
scientific commit `9e051455757d1cc86b822e52e42e1e1c98ead417`. The exact
[mixed proof](https://github.com/aliromman/integer-mult-bounds/blob/9e051455757d1cc86b822e52e42e1e1c98ead417/research/p104-parallel-bank-punctures/MIXED-PROOF.md),
[caller and emitter](https://github.com/aliromman/integer-mult-bounds/blob/9e051455757d1cc86b822e52e42e1e1c98ead417/research/p104-parallel-bank-punctures/mixed_caller.py),
[geometry](https://github.com/aliromman/integer-mult-bounds/blob/9e051455757d1cc86b822e52e42e1e1c98ead417/research/p104-parallel-bank-punctures/mixed_geometry.py),
[ordinary tariff](https://github.com/aliromman/integer-mult-bounds/blob/9e051455757d1cc86b822e52e42e1e1c98ead417/research/p104-parallel-bank-punctures/mixed_application.py)
and [source lineage](https://github.com/aliromman/integer-mult-bounds/blob/9e051455757d1cc86b822e52e42e1e1c98ead417/research/p104-parallel-bank-punctures/CREDITS.md)
are retained unchanged.

The source credits Rohan Arun's mirrored caller method, DreamingOfClouds's
nested flags and toolkit with Claude assistance, and SYLforge's signed
homogeneous word. Its phase-polynomial library is Douglas Colkitt's
retained implementation. Clear1nsight supplied the guarded physical engine.
Jerry Chen / CubeJerry supplied the selected application. The exact
[parent credit](https://github.com/aliromman/integer-mult-bounds/blob/9e051455757d1cc86b822e52e42e1e1c98ead417/research/p104-parallel-bank-punctures/credits/7726-CREDITS.md)
and all sixteen predecessor notice files remain byte for byte, with the
Apache license. Credits follow those primary notices, not only the
submitter account.

The new geometry checker evaluates phase expressions at zero, single-axis
and two-axis characters. It does not call the source polynomial code to
derive its coefficients or translations. After that calculation, the
unchanged central and native source routines provide a cross-check.
The source graph constructor, scheduler, binding and emitter remain
dependencies. Replaying the source tariff on retained native counts does
not independently establish those counts or all ordinary-service costs.

All 42 retained files are pinned by Git blob and SHA-256. The base manifest
records provenance without asserting unmerged ancestry. This package
changes no source construction, shared CI file or selected frontier.
163 changes: 163 additions & 0 deletions research/mixed-root-head-audit/PROOF.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,163 @@
# Common-head audit of one actual mixed root

## Result and exact scope

This audit checks root `('mixed',0)` in the 1,024-call schedule of PR7756,
scientific commit `9e051455757d1cc86b822e52e42e1e1c98ead417`. It checks its
sixteen physical visits, exact coordinate and phase maps, both directions
of each native boundary, and the added charge for both ordinary views.

The root has fourteen A contacts at port 0, with physical head 11, and two
B contacts at port 15, with physical head 81. Its head is the same canonical
axis `e0` after each return. All 128 body axes are spectators of the added
view maps. The root has sixty main-array visits. It requires 120 additional
permutations and 120 additional translations. The retained source bill
includes these occurrences on both entry and return.

No new kappa or whole-caller acceptance is claimed. The signed root word,
source graph construction, full native operator, numerical grids, scalar
service bounds, recursive compiler and complete price remain dependencies
or separate obligations. The selected frontier and five assumptions do
not change.

## Exact root and coordinate convention

The retained graph constructor produces SHA-256
`c6387f5a887f3ef2e79782cf2d7d167aeae5e6cd1e92d577e4c6e610ed360f84`.
Its unchanged scheduler and binding code give global root offset 89,216.
The sixteen visits are physical calls 2 through 17. Calls 9 and 10 use
port 15; the other fourteen use port 0. Body color is `call mod16`, so
this root uses every one of the sixteen body blocks exactly once.

Coordinates are binary vectors with 137 axes. An integer `2^j` denotes
axis `e_j`. Axes zero through eight are central. Color `c` has the eight
axes from `9+8c` through `16+8c`.

For a physical head `q`, the columns of `P` are `q` followed by the eight
pinned central basis vectors. Extend `P` by the identity on the remaining
128 axes. The numerical coordinate permutation sends the delta at `x` to
the delta at `P x`, with coefficient one. Its inverse is the transpose,
because the columns are orthonormal over the binary field.

| Port / kind | Head | Nine columns of P | Entry translation | Return translation |
| --- | ---: | --- | ---: | ---: |
| 0 / A | 11 | 11,13,14,7,16,32,64,128,256 | 15 | 15 |
| 15 / B | 81 | 81,82,4,8,67,32,19,128,256 | 83 | 83 |

For these two actual bases, `P` equals its transpose and fixes its
translation. Thus each complete affine view is an involution. This is a
fact about these two maps, not a requirement on every possible port.
The checker tests every central coordinate `x` and every spectator axis.

## Absolute phases and the same head

For a Fourier character `k`, write `[a,k]` for binary dot product, taken
as zero or one. The directional Clifford has phase exponent `[a,k]`
modulo four. A phase expression is a sum of integer multiples of these
parities. Let `F(k)` be the sum for the nine original central axes.
The required entry translation is the unique vector `tau` with

```text
F(k) - sum_j [P e_j,k] = 2[tau,k] (mod4).
```

The reverse computation uses `P^-1` and gives `P^-1 tau`. The checker
derives both independently and verifies the ordered inverse. It repeats
the equation for the Y frame, whose phase is `F-[q,k]` locally and
`F-[e0,k]` canonically. The same translations work for X and Y.
All four directed endpoint equations are checked on all 512 central
characters for both heads: 4,096 exact checks.

Conjugation by the numerical permutation takes `C(e0)` to `C(q)`.
Translations commute with these Fourier-diagonal operators. Therefore
the full affine view has the same conjugation action on the head.
The checker tests exponents `1,-1,2` on all 512 central characters for
each port: 3,072 signed-head checks. The squared head is the branch used
by the source normalizer. This verifies its head direction, not the
normalizer's numerical division or storage cost.

Every added view fixes all body axes. After return, the head is `e0`
again, independent of the next visit's port. The order of body colors is
`2,3,...,15,0,1`; it never changes the common head.

## Every native boundary, with a quantified phase certificate

At color `c`, the native route exchanges the eight pinned central basis
vectors with the current eight body axes. It fixes `q` and every other
axis. The checker reconstructs all 137 columns and verifies the route
inverse and every spectator.

The four boundary pairs are the X input, Y input, X output and Y output
frames. They retain the source's cumulative spectator frames and original
absolute phase convention. For each of the sixteen visits, the checker
derives the four forward shifts and the four inverse shifts. All 64
forward shifts agree with the retained source contact routine; all
inverse shifts equal the transformed forward shifts. `RESULT.json`
contains all four offsets at every visit.

These are 128 exact phase identities, not arbitrary sampled characters.
For binary coordinates, a parity has the expansion

```text
[a,k] = sum_{j in a} k_j - 2*sum_{i<j in a} k_i*k_j (mod4).
```

Terms of degree three or more have coefficients divisible by four.
Thus every phase difference here has degree at most two modulo four.
The new checker obtains its constant, linear and quadratic coefficients
from its values at zero, the 137 single-axis characters and the 9,316
two-axis characters. Each identity uses 9,454 exact evaluations. Even
linear coefficients determine a unique translation. Zero quadratic
coefficients prove the equation for all `2^137` characters. Equality
at zero fixes the constant phase. Fourier characters span the whole
array space, so these equations apply to arbitrary numerical arrays.

The source checker constructs the degree-two coefficients directly.
The new checker derives them by finite differences of literal parity
values. Both paths share the exact source basis and boundary convention;
that shared dependency is explicit.

## Both ordinary views are charged

The fourteen A visits each bind four distinct main arrays. The two B
visits each bind two. This gives `14*4+2*2 = 60` owner visits. Each has
one permutation and one translation at entry, and another of each at
return. The certificate lists all 240 distinct occurrences, with call,
local slot, owner, side and operation. These are added ordinary views;
they do not replace the existing native contact adapters or their charges.

The first root has the same physical visits in the bounded 32-call batch.
The audit reads all 398,944 emitted records of that batch and projects
this root's sixteen ordered `ENTER,NATIVE,EXIT` triples. All 48 records
have the expected owners. This is an emitter and view-order check, not
execution or symbolic verification of the complete emitted caller.

For the complete 1,024-call source invoice, the added view allocation is
819,200 permutations plus 819,200 translations. The unchanged ordinary
budget function reproduces the retained receipt on the retained native
counts. Its separate view term is `4*400*1024 = 1,638,400` array traversals.
The source uses its default map allowance at ambient 153, with multiplier
`4*154^2`, although the mixed caller has ambient 137. This is conservative
for that parameter. This audit verifies the occurrence allocation; it
does not reprove the elementary implementation cost of each traversal
or every other term in the ordinary budget.

## Controls, provenance and limits

Omitting either entry or return translation fails on central character
one for both ports: the phase error is two modulo four. Reusing head 11
for the B contact fails on character two. Removing the return records
fails the required sixteen view triples. These are explicit bounded
controls, not claims that every conceivable malformed caller is rejected.

All 42 retained files have exact Git-blob and SHA-256 pins checked before
import. The graph, scheduler, binding and emitter are source dependencies.
No retained code is modified. The separate geometry engine runs before
the source phase cross-checks. Source tariff replay uses author-supplied
native counts; it is not another native physical replay.

The full 32-edit witness, all-column native physical replay, symbolic root
program, full 1,024-call instruction stream, other roots, interval price
gate, selected cold replay, Lean and Docker were not verified here.
Separate implementation does not imply independent human or formal-kernel
acceptance. Whole-caller admission remains open.
33 changes: 33 additions & 0 deletions research/mixed-root-head-audit/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
# One mixed root keeps its common physical head

The first mixed root of PR7756 passes a separate coordinate and phase
audit at all sixteen actual visits. Its two physical heads, 11 and 81,
return to canonical head `e0`. The exact view translations are 15 and 83.
All 128 body axes remain fixed under the added views. Its sixty main-array
visits receive all 240 required entry/return map charges.

Read the [proof](PROOF.md), [per-visit and per-owner certificate](RESULT.json),
[separate phase engine](geometry.py), [checker](verify.py) and
[credits](CREDITS.md). This is local caller evidence, with no new kappa
or complete acceptance of the source construction.

Use Python 3.12 and the standard library:

```sh
python3.12 -B scripts/research_package.py --package research/mixed-root-head-audit
```

Both registered commands print `PASS_MIXED_ROOT_HEAD_AUDIT`. The exported
package also runs without Git or repository imports. It checks all central
characters and certifies the native phase identities on all 137 axes by
their exact degree-two coefficients. The source phase routines provide a
separate cross-check. All source files retain their notices and exact pins.

## Open next questions

- Does a separate symbolic execution establish the complete signed root
word and its numerical grid before and after every normalizer? The
present check verifies head directions, not the entire root program.
- Does the physical ordinary service satisfy every charged traversal and
scalar-lifecycle bound at the stated compiler size? This package checks
the two-sided view allocation, not the complete service implementation.
Loading
Loading