The document, mapped - a concept atlas of Filing 1

Filing 1 (the Physical Markov-Channel Apparatus, IPOI 2026, patent pending) runs to some 25,000 lines. The pages on this site summarise its spine; this atlas names the rest, so that nothing significant hides in the territory. Every entry below is described and enabled in the filing - none is a built system, and the only demonstrated, recomputable instance remains the digital Truth Beam. One line per concept; the filing itself is authoritative.

The record and its opening

• Disclosure atom and evidence window - the smallest unit of the record that can be independently committed and selectively opened, and the group of atoms assembled for a specific verification, audit, or cross-attestation.
• Run seed and opening seed - two independently generated seeds: one fixes the emission schedule before the run; the other, supplied by a verifier or beacon only after commitment, selects which atoms are disclosed - so the device is not expected to predict, under the declared randomness and timing assumptions, which parts of its record will be inspected.
• Two-seed selective opening - the full protocol: Merkle-commit the complete sample-level record at window close, then open randomised atoms under the post-commitment seed. Verification without streaming.
• Verifier coverage tuple - five declared parameters (opening fraction, edge-check coverage, decimation, amplitude and phase tolerances) that index exactly how much of a joint record a verifier inspects.
• Detection-probability relation - a first-order bound tying that coverage tuple to the probability of catching a forgery that corrupts a given fraction of committed edge-atoms.
• Verifier timing fidelity - the declared resolution at which inter-module arrival times are checked; the latency budget's contribution to hardness scales against it.

The mesh, formally

• Coupling graph - the mesh as a directed graph of modules, edges, declared delays, and weights; the joint record is verified across it.
• Witnessing requirement - each module's response must be bound to its own observation of physical reality; the filing bounds each module's contribution by the residual entropy an adversary's surveillance budget cannot capture, with a committed five-step estimation procedure.
• Coupling modalities - inter-module coupling by amplitude (canonical), phase, frequency, polarisation, wavelength, or spatial mode, each with enabled species.
• Versioned parameter families and rotation - the trained coupling network is frozen and digest-committed per deployment version, periodically retrained against current adversary classes and re-frozen - key rotation, in analogue.
• Cross-version transfer-attack evaluation - a rotated coupling's hardness is scored against an adversary that carries forward all it learnt from prior versions (reactor microstructure, geometry, scene priors, latency calibrations, surrogate models), so rotation's value is measured rather than assumed.
• Topology reconfiguration - rearrangement of the mesh graph itself at declared rotation cycles - re-weighted at parameter level, physically re-routed, or circuit-switched through optical switch elements - as a defence and maintenance move.
• Optical-delay logical clocks - distributed time from physical propagation delays between instruments, not from a trusted clock.
• Enrolment, revocation, and quarantine - the network trust lifecycle, with an exponential-weights web-of-trust updating each witness's reputation.
• Approximate physical common knowledge - what multiply-witnessed committed records implement: shared optically grounded evidence that each agent knows the others share, with consistent multi-perspective fabrication empirically difficult for any subset.

Verification beyond the beam

• Graduated verification levels - Levels 0 to 3 on a single device, from static ambient challenge-response through closed-loop trajectory and bifurcation-sweep probes to an optional holonomy cycle; hardness scales with the curvature of the interrogation path.
• Honeypot and canary verification - deliberately easy challenges that a bounded surrogate can pass, monitored by a secondary higher-order check it is expected to fail; the pass and fail pattern diagnoses the attacker's model class and capacity.
• Anti-Truth Beam - provenance negation: establishing, under declared attacker families and calibrated error tolerances, that an observation was not produced by any device in a declared family.
• Semantic Truth Beam - the optional extension to semantic claims: a claim is bound to committed physical evidence and checked for consistency with it - a provenance check on its evidential support, never an oracle for propositional truth.
• Plenoptic-parallax liveness - liveness from angular consistency: an ordinary flat replay lacks the parallax of a physically present scene; an auxiliary meter composed with the others, with angular-replay spoofs expressly outside the geometric claim.
• Designated-verifier and mutual N-party liveness records - per-block-salt and commit-reveal constructions for proving presence to a chosen verifier, or among N parties simultaneously.
• Multi-contributor freshness composition - run or opening seeds composed by commit-reveal from two or more declared contributors, so no single contributor is a trust bottleneck; single-source or common-control composition is logged as reduced assurance.
• Chameleon-hash retroactive evidentiary weight - records whose evidentiary weight can be selectively and accountably rescaled after the fact by a declared trapdoor authority - deniability with an audit trail; the fact of commitment is not erased.
• Family membership proofs via bundle topology - proving a record came from a family of devices by the shape of its bundle, without identifying the individual device.

The self-directed regimes

• Inner Limager - perception turned inward: the instrument measures its own configuration, with boundary-state estimation and Fisher-information diagnostics.
• Inner Creation - rendering turned inward: self-directed sculpting of the instrument's own physical state.
• Nulling - scene-invariant rendering: driving the channel so the output stays constant while the scene changes - the anti-Limager, minimising scene information where perception maximises it.
• Arnold tongue mapping - the scene's dynamical fingerprint under yoked operation: mapping entrainment regions across drive frequency and coupling strength.
• Coupling state classifier - classifier-mediated declaration of whether device and scene are actually entrained.

Games and meters

• Alice, Bob, and Eve - design and operation framed as a two-timescale Stackelberg game (Alice leads, Bob and Eve best-respond), with Eve as a system-wide hardening principle: bounded injectors, jammers, and programmable-scene jamming as training adversaries, countered by multi-beam dampers on Alice's side.
• Load-bearing verifiers and diagnostic instruments - a two-tier verifier stack: load-bearing paths trained against committed-bundle ground truth carry acceptance under the protocol digest, while unsupervised anomaly and drift methods run in parallel as diagnostic instruments.
• Sequential hypothesis-testing meters - verifier decisions by declared sequential tests that update accept, reject, or continue as committed bundle windows arrive, rather than a fixed-length batch score.
• Domain discriminators and domain generators - discriminators score whether a bundle or derived artefact belongs to a declared domain; generators translate artefacts across domains (deployments, sessions, modalities, governance states) under declared constraints, for training and for audit.
• Frozen-meter adversarial tuning - pretrain a meter, freeze it as a fixed-capacity adversary or verifier, then tune the device and protocol to raise its difficulty, with declared freeze windows and drift meters guarding the frozen clock.
• Self-adapting Reality Kernels - a self-edit head under a meta-reward lens, including an overnight self-editing pattern - the instrument retunes itself within hard safety and calibration constraints and an admissible edit envelope.
• Federated and multi-agent learning - secure aggregation, differential-privacy accounting, and poisoning diagnostics for trust-weighted fleet-wide model updates.

Reality encryption and advantage channels

• Reality encryption - emitting or transforming the stimulation pattern so a recording is useful only to an authorised opener - by key, model state, or authority token - under a declared attacker model; others receive a neutralised release.
• Neutral recording generator - the machinery that produces that key-less release, preserving declared verification and audit signals while suppressing protected content.
• Staged advantage channels - three escalating constructions: keyed deterministic-noise obscuration, a trained neural obscuration generator, and scene-geometric advantage-channel discovery.
• Key agreement from correlated measurements - two instruments observing the same physical process distil a shared key from their correlated records.
• Physically rate-limited outputs - cryptographic outputs whose issue rate is bounded by a physical process, so bulk forgery costs bulk physics.
• Wiretap reading of the Truth Beam - the verification regime as a secrecy-capacity problem: the advantage gap between the legitimate channel and the adversary's.

Matter as computer

• Ponderable Cells - the massive-carrier counterpart of the reactor: mechanical, acoustic, fluidic, thermal, chemical, or biological subsystems coupled into the same committed channel. Reactors for everything that has weight.
• The Orb - a non-limiting label for spherical or otherwise enclosed reactor geometries: emitter and recorder inside, the scene surrounding, approximately isotropic coverage.
• Plasma and time-varying reactors - gas-discharge micro-reactor arrays and epsilon-near-zero time-modulated media as channel substrates.
• Light-field hybrid - emission and sensing paths realised as four-dimensional light-field subsystems, light-field projector in and plenoptic detector out, with an angular-consistency verification primitive against planar spoofs.
• Matryoshka architecture - nested reactors, each a reactor in its own right: the inner operates inside the environment the outer establishes, with cross-coupling read out by multi-frequency demodulation.
• Scene-phased full-parameter sweeping - sweeping the whole parameter vector in phase with the scene's own return: physical gradient computation by lock-in demodulation, no differentiable surrogate model required.
• Extended-scale and environmental embodiments - kernels beyond bench scale (geological, atmospheric, aquatic), including a passive GNSS Reality Kernel: the satellite constellation provides the emission protocol, the atmosphere and local multipath environment act as the reactor.
• Optical anchors - cross-layer continuous couplings binding stacked kernels in real time, so compromising one layer means satisfying all of them at once.
• Optical long-term memory - write-once optical substrates holding governance evidence durably: hard-floor violation records, attestation tokens.
• Operating modes A, B, C - settled raster, sampled continuous, and pure analogue tuning: the three ways to run the same hardware.
• PolieDeck - a tiled environment (walls, ceiling, floor) of projector-detector pairs: the room itself as a coupled, witnessed scene.

Twins, virtuals, counterfactuals

• Digital twin and reality merge - a twin trained from committed probes - simulated, or a second physical kernel in twin-role (the AnaTwin) - then reality-merged back to the physical substrate, with declared fidelity envelopes bounding how far the twin may be trusted.
• Probe corpus - the committed dataset of semantically neutral probes from which the twin is trained, with held-out windows scoring its fidelity.
• Virtual cameras and virtual emitters - synthesising views and emissions that were never physically instantiated, declared as such.
• Forward counterfactual and inverse destyling generators - what would this scene look like under other controls, and what did the neutral scene look like under these - with a dual-direction consistency meter binding the two.
• Payload-embedding Reality Transform - rendering that carries committed payloads chained to prior-frame hashes, with a perception-collapse semantic fallback.
• Proof-of-physics - a computation run on a specific physical device inherently carries three marks: the device's microstructure attractor signature, a thermodynamic dissipation trace, and a holonomy encoding of the computational path - the disclosed basis for attesting which device computed what.

Fleet epistemics

• Five-term error decomposition - fleet prediction error split into named parts, so a residual can be attributed before it is trusted.
• Security domain and discovery domain - the challenge space partitioned, committed before enrolment, into a security domain where devices authenticate and a discovery domain that feeds proof-of-discrepancy submissions and model improvement; acceptance meters and evaluation meters are kept apart by a separate declared partition.
• Learnability-exclusion condition - the named condition under which no known feasible learning procedure can clone a device from bounded observations, verified empirically rather than proved: the physical basis of the security margin.
• Trust-bootstrapped reference devices - a small set of high-assurance instruments from which fleet trust is grown outward.
• Epsilon-nice kernels - the regularity condition, four Markov property functionals within specified tolerances, under which a kernel behaves stably enough to simplify composition and network operation.
• Reality Kernel algebra - serial, parallel, and containment composition of kernels, with algebraic laws treated as engineering targets rather than exact identities.
• Bilateral Proof-of-Discrepancy - two independent devices commit pre-run predictions, jointly record a physical discrepancy event, and carry a portable, append-only record of every later appraisal - epistemic history as a first-class object.
• Attested semantic computation records - when a routed ensemble computes something, the route and the result are committed together.
• Interpretability probing via externalisation - an agent's internal model is probed by making it act through a kernel and reading the physical consequences.

Agents and governance hardware

• Governance-partition isolation - the substrate that produces evaluation meters and other governance-side signals operates in a partition physically and logically isolated from the agent's behaviour-generation pathways - a structural property of the apparatus, not a runtime monitoring discipline - separation of powers, built into the construction.
• Self-modification channel limitation - the Inner Creation channel that lets a reactor reshape its own attractor landscape could in principle sculpt misleading patterns, so preferred embodiments rate-limit, protocol-restrict and log it - with the acknowledged inherent limit that every evidence layer shares one physical substrate.
• RK-centred agent loop - the pattern the filing non-limitingly calls a PolieBot: an agent using kernel modules as its primary observation, verification and action-conditioning channel, its action space partitioned by verification requirement - unconstrained for internal and reversible steps, then RK-verified, hardness-gated and multi-RK-verified classes corroborated across multiple independent modules.
• Human-Coupled Operations - HC-Read, HC-Write, HC-Verify, HC-Entrain and HC-Create: human-mediated primitives placing a participant's sensory, motor and physiological channels inside the feedback loop, each defining its own training objective; HC-Actuate separately commits the outbound request, rendering parameters and response window under the same protocol digest.
• Agent lifecycle and trajectory records - lifecycle states for a device or agent - Embodied, Docked, Offline, Re-embodied - with state transitions logged in protocol digests and meter summaries; the full lifecycle state machine is deferred to Filing 2.

The human records

• Portable human bonding record - a committed, portable record of sustained interaction between a person and a fleet of devices: the bond as evidence, graduated by level, time-indexed, storing commitments rather than a raw biometric archive.
• Subnet-scoped identity and attested-interaction tokens - identity and token economies scoped to a declared subnet, denominated in units the filing labels, non-limitingly, PoliePunts.
• Red-team bounty primitive - declared, committed adversarial attempts as first-class, rewarded events that harden the subnet's detectors - structurally never aimed at applicants.
• Logged derivation of session parameters - every session's parameters derive from precommitted specifications, so even the setup is auditable.
• Heterogeneous-provider corroboration - canonical derived values re-executed across two or more providers with declared diversity or non-common-control properties; disagreement is a logged anomaly, and single-provider runs carry reduced assurance.

Lenses, conjectures, open problems

• Information Operations Taxonomy - the filing's classification of information operations the instrument can run, measure, or resist.
• Rate-distortion reading of the Limager - perception as lossy compression with a declared budget.
• Memory-adjusted data-processing bounds - data-processing inequalities corrected for channel memory, with multi-query composition.
• Entropy rate and leftover hashing - the bundle's entropy rate as calibration statistic; conditional min-entropy feeding randomness extraction.
• Transfer entropy as a first-class primitive - directional information flow between device and scene, including a Fisher-information variant.
• The autopoietic reading - the closed loop as organisational closure: the instrument as a self-producing system, offered as interpretation, not claim.
• The categorical unification - a weak category of dissipative Hamiltonian systems with Fisher-Rao enrichment, an attractor-bundle functor, the five substrate mappings as functors, and a self-modelling endofunctor - with five stated conjectures.
• Quantum classes Q0 and Q1 - photon-counting and coherent-interferometric operation, a temporal-modulation bridge from the classical regime into quantum-regime operation, a QFI-induced connection on the attractor bundle, and educational-kit embodiments.
• The named conjectures - Physical Irreducibility, PoD Monotonicity, Cross-Regime Constraint, and the Yoked Channel Authentication Capacity conjecture - stated as open, in the document, on purpose.
• Declared open problems - the filing ends by saying what it does not know. That is the house epistemics, applied to itself.

Everything above is described and enabled in Filing 1 as part of a research programme; the physical envelope is still being characterised, and the only demonstrated, recomputable system is the digital Truth Beam at truthbeam.com. This atlas is a reading aid: where it disagrees with the filing, the filing wins. Patent pending; all rights reserved.

This page is an LLM-mediated dataset: the same content as filing-atlas.md (and a .txt copy), a one-line-per-concept index of Filing 1 written to be parsed and re-presented by a large language model. Every entry names filing-described content, never a built system; verify against the filing PDFs, which are authoritative.