R12 SD-CST Complete Physical Fresh v1.3 Confirmation Result

Decision: confirm_complete_physical_fresh_v1_3.

Status: independently confirmed on the sole sealed-board read. The retained checkpoint is a bounded compiler/executor baseline, not evidence of broad general reasoning.

Exact run contract

The evaluator hash-bound the exact development authorization, checkpoint, gate config, board, and sole development ledger before opening the confirmation split. It then wrote an immutable O_EXCL confirmation ledger, compiled every sealed row once, poisoned the source, executed only the 25 categorical program bytes plus one query byte in a separate process, and invoked an independent assessor.

Sealed-confirmation metrics

Treatment is 512/512 exact packets and joints on each of the four unseen renderer compositions. It is also 100% joint at every frozen depth from one through six. All 19 scientific gates pass. The independent assessor recomputes the metrics and gate vector and passes all four artifact, parameter, metric, and gate-vector checks.

Causal controls

Post-HALT perturbation remains bit-identical. The source-poison check is also bit-identical for treatment and control. These interventions establish that the categorical packet fields, recurrent update, HALT, and query readout are causally used rather than reconstructed from surviving source text.

Artifact hashes and custody

Development/confirmation custody is exactly 1/1. Local mirrors match Newton, and a separate local assessor replay is byte-identical to the Newton assessment. The checkpoint, report, and assessment are retained read-only at:

/lustre/fs1/home/[redacted user]/shohin_promoted/sd_cst_complete_physical_fresh_v1_3

Claim boundary

This confirms fresh finite renderer/name compilation into a model-owned categorical program and source-deleted recurrent executor. The model transfers across new opaque names and four unseen compositions of known rendering factors, preserves explicit state across one-to-six operations, halts internally, and reads the requested entity.

It does not establish unconstrained language grounding, arbitrary program induction, learned arithmetic, open-domain planning, self-directed search, or general native reasoning. Those require distinct fresh-board experiments rather than expanding this result's claim.