Foss Lifted Compute Architecture (FLCA)

A dual-plane algebraic computing architecture for operator routing, lifted execution, hidden information channels, and deterministic replay.

FLCA v0.2 snapshot is the current self-contained technical disclosure and executable research artifact authored from work originated by David Tom Foss. It packages six reviewed implementation snapshots: strict operator-family routing, source-backed algebra discovery, visible lifted execution, finite-ring hidden observation channels, digest-bound compilation and replay, and the content-addressed Source/Goal Evidence Layer.

The frozen flca-disclosure-v0.1.0 tag remains the original five-component technical disclosure. The current main line adds the reviewed Compiler G4 admission surface and the executable source/goal ledger. This repository records technical provenance and executable evidence; it does not state a filing date, priority date, or patent grant.

The contribution in one view

flowchart LR
    S[Source-backed formulas and operator families] --> E[Evidence boundary]
    O[Observed matrices] --> R[FLCA Router]
    E --> R
    R --> C[FLCA Compiler]
    G[Validated graph substrate] --> C
    Z[FLCA Ring Extension] --> C
    C --> P[Digest-bound dual-plane plan]
    P --> X[FLCA Runtime]
    X --> V[Visible lifted execution]
    X --> H[Hidden observation channel]
    V --> D[Typed evidence]
    H --> D
    D --> Q[Selected-only deterministic replay]

Loading

FLCA's defining system boundary is not merely “run two algorithms.” The visible and hidden planes share immutable graph evidence and compiler policy, but do not share mutable state. The compiler retains accepted and rejected alternatives, selects only after explicit gates, binds the selected context into SHA-256 addresses, and can replay only the selected visible candidate and its atomic coded/null hidden pair.

Components and current admission state

FLCA component	Implementation snapshot	State
FLCA Router	spectral-regime-router	reviewed and included
FLCA Compiler	algebraic-fiber-compiler	G4/admission-reviewed and included
FLCA Ring Extension	ringfiber-codec	reviewed and included
FLCA Evidence Layer — Algebra Discovery	algebra-discovery-mvp	reviewed and included
FLCA Runtime	fibered-lifted-lab	capacity-reviewed and included
FLCA Evidence Layer — Source/Goal Ledger	spectral-fiber-suite	reviewed and included

The exact upstream commits and every admitted file digest are recorded in COMPONENTS.json and explained in COMPONENTS.md. Nothing is copied from a mutable component working tree.

The admitted Runtime contains the finite-DMC endpoint-capacity interval implementation. The current Compiler snapshot adds endpoint-capacity serialization, final Z/9Z action admission/replay, and checked G4 evidence. The current Evidence Layer adds the source inventory, source-use ledger, executable goal graph, and live-versus-vendored evaluation boundary.

What is disclosed

• A strict, non-repairing operator validator and evidence router that emits a conservative route or an explicit insufficiency instead of forcing a class.
• Exact discovery of the one-parameter doubly stochastic law P(lambda) P(mu) = P(lambda mu), with positive, dimensional, and coherent power-product controls.
• A two-layer PS-Lifted push-sum plane and a separate cyclic/finite-ring hidden observation plane over one deterministically oriented graph substrate.
• Finite-ring extensions Z/mZ -> Z/kZ, unit actions, quotient-character and full-character probability profiles, matching structural nulls, and typed observation evidence.
• A bounded compiler that retains topology, calibration, candidate protocols, independent random streams, source labels, outcomes, and rejection reasons in immutable digest-addressed records.
• Exact selected-only replay that rejects coordinated outer-context, provenance, protocol, topology, stream, evidence, and run-address drift before accepting a replay match.
• A content-addressed source/use ledger and executable, non-command goal DAG interface whose file, manifest, and reachable-commit gates derive complete, ready, or blocked states without handwritten status flags.
• A finite-DMC capacity interval algorithm that separates endpoint, full_path, and decoded_symbol observations and returns no point estimate when the primal/dual certificate gap remains open. The capacity-reviewed Runtime snapshot includes its checked wheel, source, tests, finite bounds, and deterministic result artifacts.

The complete enabling description, equations, embodiments, parameter ranges, state transitions, failure modes, and confirmed experiments are in TECHNICAL_DISCLOSURE.md.

Evidence is typed, not blended

FLCA uses five labels throughout the disclosure:

• analytic — an identity or derivation independent of sampling;
• certified numerical — deterministic finite computation with explicit, reconstructible bounds and tolerances;
• empirical — deterministic seeded finite-sample evidence;
• routing evidence — observed properties used to choose a conservative execution path, without claiming a universality class;
• planned — source-backed work not admitted as a released finding.

In particular, empirical mutual information from decoded sampled walks is not channel capacity. Finite-DMC endpoint capacity is not full-path information. An exact structural null is not inferred from a merely small floating-point number.

G4 Z/9Z admission

The bounded G4 protocol used seeds 20260808 and 20260809, 90 trials, 60 steps, clean/0.25/0.5 loss conditions, and path, barbell, shortcut-ring, and vortex-compatible substrates. A candidate had to improve its compared information score by more than 0.02 on both seeds for at least one condition on at least two substrates. Matching-null maximum information was exactly 0 in this run.

• Fiber rotation (m=9, k=3, a=4, b=7), quotient-coded, passed on shortcut-ring and vortex-compatible substrates.
• Involution (m=9, k=3, a=8, b=8), character-coded, passed on path and vortex-compatible substrates.

The current Compiler snapshot reproduces these actions through its checked G4 admission artifact. Exact decoded/full-path empirical deltas, analytic endpoint capacity records, matching nulls, and the negative admission decisions for generator and identity variants are retained in the component evidence files.

Verify the current snapshot

The root verifier uses only the Python standard library:

PYTHONDONTWRITEBYTECODE=1 PYTHONWARNINGS=error \
  python tools/verify_repository.py --skip-manifest
PYTHONDONTWRITEBYTECODE=1 PYTHONWARNINGS=error \
  python -m unittest discover -s tests -v

For the current six-component snapshot:

./run_all.sh --verify-only
./run_all.sh --tests-only
sha256sum -c MANIFEST.sha256

Immediately before an approved first commit, the separate Git-index preflight also proves that every manifest-bound file was actually staged; see PUBLISHING.md. This matters for the one intentionally checked Runtime wheel, because ordinary dist/ output remains ignored.

Each included component also retains its own README, package metadata, tests, and checked result artifacts. The root runner installs nothing and performs no network access.

Boundaries

FLCA's scope is drawn deliberately, and the boundary is a design feature: every claim in this repository is typed by the disclosure's evidence language (analytic, certified numerical, empirical, routing evidence, planned), tied to its observation contract, and bound to an executable, digest-addressed artifact — a claim never extends past what its artifact executes and replays. The hidden plane is an observation channel with measured, contract-typed capacity for exactly the observation types supplied to the capacity algorithm; its guarantee is deterministic, selected-only replay. Input discipline is equally deliberate: invalid, non-finite, oversized, structurally ambiguous, detached, or digest-inconsistent inputs are rejected or held for more evidence — the architecture refuses rather than guesses.

This repository is a technical disclosure, not an open-source release. No OSI license or patent grant is included. See NOTICE.md, INVENTORSHIP_AND_PROVENANCE.md, and PUBLISHING.md before redistribution or publication.

Navigate

• Technical disclosure
• Inventorship and provenance
• Component map
• Reproduction and publishing checklist
• Contribution boundary
• Security policy
• Rights notice