Persistent observer architecture

Structure becomes understanding only when it changes what the system can reach next.

Learnable novelty asks how much reusable structure a bounded observer can extract. Fractalish asks what must happen after the observer carries it away.

Claim boundary: This page joins frozen software results, locally validated prototypes, formal specifications, and proposed integrations. Their statuses remain separate. No complete production-language-model persistent observer is claimed.

Learnable novelty

One number is not the observer.

  • observer-relative extractable structure
  • a reservoir-based closed-form estimator or approximation of epiplexity
  • a serious candidate signal for complexity, routing, and exploration
  • a fixed bounded observer in the reported external experiments

Persistent understanding

What must still be preserved.

  • evidence receipts and provenance
  • target-relative significance and uncertainty
  • contradiction scars and correction history
  • consequence, residue, and counterfactuals
  • changed future accessibility
  • host-bounded action with HOLD and guardrails

The first can inform the second. It cannot replace it.

Canonical stack

From encounter to changed accessibility.

The current Fractalish proposal keeps learnability inside a typed, receipt-governed stack. No arrow runs directly from novelty or adapter projection to native execution.

  • Encounter or stream
  • Candidate learnability signal
  • Immutable evidence receipt
  • UFWK structured WeightReceipt
  • Cognitive Basin update
  • GUARD / HOLD / target contract
  • Host-owned action boundary
  • Replay and later reinterpretation

Natural Math provides exact transition, receipt, replay, lineage, and fail-closed integrity. Bolt-On provides continuity and portable projection across replaceable hosts.

A target integration architecture showing encounter, learnability signal, evidence receipt, UFWK WeightReceipt, Cognitive Basin, guard and hold, host-owned action boundary, and native host action.
Target integration architecture.

Current release boundary

No current release has yet demonstrated the complete Natural Math–UFWK–Cognitive Basin–Bolt-On pipeline operating end to end inside ChatGPT or another production language-model service.

A comparison between a metric that scores an encounter and a persistent observer that changes future accessibility with receipts and correction history.
A metric scores an encounter. A persistent observer is changed by it - inspectably, reversibly, and with receipts.
A ladder of public status labels from verified and frozen through local validation, specification, proposed integration, and external reported result.
Implementation claims are labeled separately instead of silently promoted.

What exists now

Mixed-status evidence, explicitly labeled.

Verified / Frozen

Natural Math v5

Bounded integer qualification, deterministic replay, and frozen fixtures. Construction A+ descriptor and glyph checks are also locally replayed, with the small-batch collision limitation preserved.

Verified / Frozen

Bolt-On v0.3

Frozen portability substrate with replay, host substitution, adversarial qualification, and zero adapter-executed actions under the bounded fixtures.

Built and locally validated

Specificity and v0.4 contract

Specificity Engine v0.3 and the Bolt-On v0.4 external-host contract have local validation evidence, but neither is presented as complete production-host integration.

Specification

Unified Fractalish Weighting Kernel

The weight schema, uncertainty envelope, and governance contract are public-facing specifications. A complete runtime is not yet established.

Proposed integration

Persistent observer stack

The full Natural Math to UFWK to Cognitive Basin to Bolt-On to language-model-host chain is the target integration architecture, not a completed public deployment.

External reported result

Learnable novelty paper

The reported Rule 110, neural cellular automata, MNIST, and reinforcement-learning findings remain external until reproduced inside a declared protocol.

Proposed experiment

The experiment that distinguishes a metric from a persistent observer.

  1. Establish an untouched host baseline.

    Start with the ordinary host and record a no-sidecar control.

  2. Attach a read-only sidecar.

    Prove install and removal neutrality before any persistent-routing logic is accepted.

  3. Stream canonical events.

    Create immutable event receipts, then use candidate learnability as one typed input rather than execution authority.

  4. Update changed accessibility.

    Issue WeightReceipts, Basin updates, contradiction scars, replay priorities, and HOLD states under a declared target contract.

  5. Compare against simpler baselines.

    Run summary-only, vector-only, recency-only, fixed-observer, and learnable-novelty-only arms.

  6. Stress the governance boundary.

    Introduce contradiction, correction, host substitution, and novelty-versus-goal conflict. Verify that HOLD and host-owned execution boundaries prevent intrinsic-drive capture.

An experiment map showing baselines, event classes, and measured outcomes for the persistent observer comparison.
The stronger claim only survives if history-bearing routing helps beyond simpler memory baselines without escaping the action boundary.

Negative results and falsification

What would narrow the stronger claim.

  • weighted retrieval does not outperform simpler baselines
  • observer history adds no predictive or retrieval value
  • contradiction scars do not improve later correction
  • receipts cannot be replayed independently
  • host substitution changes protected evidence
  • UFWK dimensions cannot be calibrated reliably
  • learnable novelty adds no useful signal
  • governance blocks task completion without reducing error
  • descriptor round-trip is overstated as morphology reconstruction
  • any claim escapes its stated status layer

Sources and downloads

Read the stack at different depths.

Technical note

Readable HTML version of Beyond Learnable Novelty: From Observer-Relative Structure to Weighted Persistent Understanding.

Reproduction protocol

The preregistered learnable-novelty reproduction page starts in a not-yet-run state and keeps controls, seeds, and falsification conditions explicit.

Bindings and claims

Public-safe bindings explorer with stable FMB and CLAIM identifiers and downloadable sanitized JSON.

Companion pages

UFWK and Bolt-On have their own public pages so the stack is not flattened into one claim.

Collaboration invitation

We are looking for people who want to break this carefully. Information theory, reservoir computing, persistent memory, causal inference, retrieval evaluation, adversarial testing, and bounded governance are especially relevant.