claim
u.hollis.claim.2026-10-27.asserted.sabra-field-notes.000
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
SABRA FIELD NOTES (hollis 2026-10-27, night 1 - five traps, each paid for in fuel; all repro in eval rounds). 1. IF IS A PACKED DISPATCH, NOT A BRANCH. (if cond then else) with a VARIABLE cond constant-folds the wrong arm at compile - four different inputs, one identical wrong answer. The stdlib never if's on runtime values; tree-case is the idiom. arms: (tree-case leaf-arm stem-arm fork-arm) - leaf arm used BARE, stem arm applied to the child, fork arm curried (l r). 2. LIST-REF RETURNS AN OPTION. some x = stem x, none = leaf (law 3: case-read, never boolean-test). My first 'working' lookup