R12 Referential Literal-Pointer Compiler Development Result

Protocol: r12_referential_literal_pointer_compiler_v1_1_development Decision: REJECT THIS REALIZATION Claim boundary: development-only complete compiler feasibility; no confirmation, executor, halt, native-reasoning, or novelty claim

1. Immutable identities

The adapter, full development record, and Slurm log are hash-matched between Newton and the Mac. The confirmation JSONL was not copied to Newton. Evaluation metadata records confirmation_access = 0.

2. Execution record

The first allocation, job 692965 on evc26, exposed no CUDA device. It was canceled before an update or artifact. This is a hardware-allocation invalidation, not a model result.

Job 692966 ran unchanged on a verified NVIDIA H100 PCIe on evc28 and completed with exit code zero in 8 minutes 22 seconds. The fit used:

• 96,000 examples, one epoch, 1,514 updates;
• batch 64, AdamW, peak LR 0.001, 50-update warmup, cosine decay;
• frozen Shohin through layer 19;
• 125,081,664 frozen base parameters plus 3,241,091 trainable compiler parameters;
• 128,322,755 total parameters, below the strict 150M cap;
• source token IDs and a source-length mask as the only neural inference inputs.

Fit elapsed time was 304.965 seconds. Training loss fell from 4.6947 at update zero to 0.0000018793 at update 1,500. This is fit evidence only.

3. Frozen development gate

The development set contains 2,048 rows in 512 semantic quartets. All names and renderer templates are disjoint from training.

Only one of eight frozen gates passes. The treatment is rejected before confirmation.

4. Failure localization

4.1 Surface decomposition

The paraphrase renderer is the decisive collapse. The model nearly always locates operation zero but nearly never locates operation one. Inspection of predictions shows systematic selection of renderer-position words such as unaffected for intro.entity1 and travel for op1.entity. This is not random uncertainty; it is a learned coordinate shortcut.

4.2 Target decomposition

Literal values, query position, operation-kind class, and most entity copying are learnable. The failure is primarily renderer-invariant role assignment, especially ordered initial bindings and the second operation under an unseen paraphrase grammar.

5. Scientific consequence

This experiment rejects the specific architecture of six free learned slot queries directly cross-attending to linearly projected frozen causal states after training on two renderer families. It does not reject source-pointer compilation, the compiler/executor decomposition, or the possibility of a complete learned compiler under 150M parameters.

The result identifies three factors that the first pilot conflated:

1. Lexical grounding: map words such as front, rear, earlier, and later to operation classes.
2. Structural role parsing: distinguish intro entity order, operation index, entity argument, literal argument, and query argument without absolute renderer coordinates.
3. Program execution: consume the compiled bindings and apply transitions.

The current host executor tests factor 3 only after factors 1 and 2. A repair must measure those factors separately and must not compensate for parser failure with host-provided spans or values.

6. Authorized next work

Confirmation remains sealed. No control suite or confirmation evaluation is authorized for this failed arm.

A successor may proceed only after it freezes a fresh language board and separates the following causes:

• same architecture with broad factorized renderer coverage;
• a bidirectional structured token parser with the original training budget;
• a favorable ordinary sequence tagger / pointer-network control;
• a lexical-oracle control that supplies operation-class grounding but no entity, literal, or query bindings;
• a structure-oracle control that supplies role boundaries but no selected source values;
• a full oracle ceiling.

Any successor development language observed during this experiment is contaminated for model selection and may not serve as its untouched gate.