Selected engineering record / evidence-bounded

The question, the evidence, the decision, and the limit.

These cases show how I work with complex AI systems. Each one includes what was established and what was deliberately left unclaimed.

Provisional / review pending

Case 01

Machine Governor P0-RL

Current programme result, 24 August 2026

Mechanisms mapped35
Current firing/output21
L2 loops0
L3 loops0
L4 loops0
Formal closureHeld

The problem

SAGE contained many components described as learning, recursive, adaptive, replay-based, experimental, or self-improving. The load-bearing question was not whether those components existed. It was whether a verified result from an external worker changed how the next worker was treated.

The method

The P0-RL pass classified parameter learning, meta-learning, structural learning, closure-derived learning, experimental learning, and repair/policy learning. It then traced whether each mechanism merely recorded an event, changed internal SAGE behavior, changed a later worker invocation, produced independently verified improvement, or transferred retained learning across providers.

L0  record, classify, queue, or preview
L1  result is consumed by an internal SAGE mechanism
L2  retained result materially changes a later worker invocation
L3  the change improves an independently verified held-out result
L4  the retained improvement transfers across workers/providers

The finding

SAGE already has a substantial active internal learning ecology. Hebbian Paths A and C, SAGERecursive._meta_update, SSM, DDSS modulation, MML, Discovery, G1, shadow learning, KAS replay, repair logic, SCAL, ProofKit, and related processes had current evidence or current output.

But the programme found no current mechanism that learns how to treat the next external worker differently. Internal learning was real; worker-steering learning was absent.

The engineering decision

Track-2invocation / admission / closure facts
G1shadow interpretation
KASgoverned failure classes
steering_updatenew thin consumer
WorkRequesttask contract changes
ContextReceiptaccepted context changes
CapabilityEnvelopetools / paths / budget change

The correct reuse decision is to compose Track-2, G1, and KAS with one deterministic host-owned steering consumer. No new learning database or general learning engine is required.

Rejected architectural shortcuts

  • Do not connect worker closure directly into Hebbian learning.
  • Do not use SSM or DDSS parameter modulation as worker-task steering memory.
  • Do not use MML or Discovery as a substitute for tool, context, budget, and verification policy.
  • Do not call the replay queue worker steering merely because it stores replayable events.
  • Do not put another AI model in charge of the first steering consumer.

What this demonstrates

Complex-system re-derivation, semantic discrimination between different kinds of learning, multi-worker programme direction, architecture reduction, and the ability to preserve a zero result instead of converting activity into an improvement claim.

Claim boundary: the P0-RL execution is reported complete and the primary finding is provisionally accepted. The evidence packet still requires artifact review, followed by a bounded Codex adversarial challenge. No P1 implementation is authorized by this result.
Qualified / bounded

Case 02

DecisionBundleV1 P1

Honest evidence rebuild, August 2026

Clean-worktree tests315 passed / 0 failed
Established resultPackage internal consistency only
Broader recordUNESTABLISHED
Predictive edgeNOT_ESTABLISHED

The problem

A verification package can easily become a persuasive-looking wrapper around evidence it does not actually establish. The objective was to create a candidate that could verify its own internal consistency, detect tampering, reject unsupported verification profiles, and refuse the broader claim when external evidence was missing.

The result

A qualified exact-SHA candidate passed 315 tests in a clean worktree. Its P1 archive reproducibly verifies package internal consistency. The broader full_record result remains UNESTABLISHED.

Why the refusal matters

The strongest property is not that the package always returns a green result. It can produce a typed negative boundary when the evidence needed for a claim is not present. The verifier does not silently upgrade package consistency into chronology, external effect, correctness, transferability, compliance, or market value.

A verifier that cannot say "the evidence does not establish this" is not a verifier. It is a presentation layer.

What this demonstrates

Exact-artifact qualification, test and hash discipline, adversarial claim reduction, refusal semantics, and the separation of package integrity from broader truth.

Claim boundary: no external participant result, certification, demand, legal admissibility, universal transferability, or broader-record proof is claimed by the P1 package result.
Closed on testnet

Case 03

OVL paid attestation rail

Mechanism closure, 21 June 2026

NetworkBase Sepolia
Paymentx402 / test USDC
SignatureEd25519
Tamper tests4 / 4 rejected
PayerSelf-paid

The problem

Could a machine-to-machine attestation be issued only after a real settled testnet payment, cryptographically signed, bound to its mandate, recorded in the ledger, and independently re-derived without trusting the issuer?

The result

The first mandated paid issuance landed at ledger sequence 2000. An independent verification pass recomputed the content hash, verified the Ed25519 signature against the published key, correlated the payment and ledger row, checked the hash-chain predecessor, and rejected four altered variants.

Security boundary

The payment key remained operator-side and never entered the agent context. Issuance and verification were deliberately separated so the issuer did not bless its own output.

What this demonstrates

Cryptographic receipt design, payment-to-evidence correlation, operator/agent key separation, independent re-derivation, and scoped closure criteria.

Claim boundary: self-paid testnet mechanism proof is not external demand, real economic value transfer, mainnet operation, decision correctness, verified mandate authorization, legal admissibility, or compliance certification.
Falsified / held

Case 04

Energy prediction truth correction

Governed correction, August 2026

Governed accuracyApproximately 46.5%
Persistence advantageNot demonstrated
Earlier headlineSuperseded
Predictor statusFALSIFIED_HELD

The problem

High raw directional accuracy had been interpreted as predictive performance. Later governed evaluation showed that the result was substantially explained by persistence and did not demonstrate an out-of-sample edge.

The decision

The optimistic performance narrative was withdrawn. The predictor was held. The machine-facing surfaces were corrected so raw observational numbers could not be read as validated predictive performance without the adjacent governed status.

What remained valuable

The public, timestamped record; daily history; external Nord Pool outcomes; typed correction; tamper evidence; and the method for letting an outsider re-grade the result without trusting the operator.

What this demonstrates

Willingness to falsify the original product claim, preserve the negative result, correct public interpretation, and retain the evidence mechanism that survived.

Claim boundary: the energy record is evidence of honest prospective grading and correction. It is not evidence of a profitable forecasting edge.
Implemented historical milestone

Case 05

Track-2 closure ledger

Reduced to practice, April 2026

The problem

Agent activity, governance decisions, closure events, and consumed substrate context were distributed across domain-specific surfaces. Cross-agent comparison required a generalized record without allowing the record itself to widen authority.

The implementation

The design was reduced to four append-only record families: agent_invocation, governance_admission, closure_event, and substrate_consumption. Runtime hooks were added at energy, trading, governance, and engineering dispatch points with non-blocking writer semantics and explicit authority_granted separation.

Why it matters now

P0-RL determined that Track-2 is the correct factual base for worker steering. It is not itself operational steering memory. A later deterministic consumer must interpret qualified facts and alter the next worker envelope.

Freshness boundary: this case records an implementation milestone and its role in the current architecture. It does not assert that every April runtime count or hook status remains unchanged today.

The common thread

I do not try to make every result look successful. I try to make every result legible enough that the next engineering decision becomes smaller and more correct.