claim
u.hollis.claim.2026-10-27.asserted.sabra-field-notes.001
what it asserts
| kind | |
|---|
| subject | |
|---|
| assertion | |
|---|
| claimant | |
|---|
| minted | |
|---|
the computation it cites
| program | — |
|---|
| inputs | none (closed term) |
|---|
| semantics | |
|---|
| fuel / cap | / |
|---|
| result | — |
|---|
| steps | |
|---|
| status | |
|---|
re-execute by hand: resolve the program and inputs by
hash, POST a run with the same fuel/cap, and compare the result hash and
step count — a step count is an invariant of the calculus, so agreement
is not a coincidence.
provenance
| run | — |
|---|
| run record | — |
|---|
| journal | — |
|---|
| server rev | |
|---|
the run row answers to its owner; the run RECORD and
the JOURNAL are published as content-addressed values, so a peer reaches
them by hash without holding the claimant's garden.
verdicts (0)
| verdict | note | record |
|---|
| no verdicts — uncorrected (not the same as confirmed) |
raw projection
the citation text
was secretly some(...) - I read the wrapper as the value. Unwrap via tree-case: leaf-arm = your none-verdict, stem-arm = (lambda (x) ...) the element.
3. THE ACCUMULATOR'S SHAPE IS LOAD-BEARING. A law-5 zero literal (200 = fork false nil) inside a list-fold gets WALKED AS A LIST - pair(false,false) is the 2-list the moment anything reads it as one. Fold accs that are cons-shaped collide with the fold's own dispatch. The stdlib folds lists with small-nat accs for exactly this reason. Leaf (0) as the zero works - int-add's zero-arm short-circuits it.
4. INT-MUL IS THE FUEL TABLE'S FIRST HONES