BIT-COG-001-R0 — Hierarchical Retentive Assembly and Bounded Verification: Master Overview, Claim Boundary, Reproduction Guide and Independent Research Handoff

Abstract

BIT-COG-001-R0 is the independent-research handoff release of the Boundary Information Theory memory and consciousness-claim-boundary program through F5R1. It converts an early conceptual lineage—boundary observers, self-reference, transformed perception, embodied brain-heart coupling, historical memory, causal obligations and possible cross-death continuity—into a typed and scope-limited research architecture. The release formalizes Hierarchical Retentive Assembly (HRA): stable components are not sufficient for memory. A candidate memory domain additionally requires historically discriminative retention, renewal invariance, cross-scale readout, decoding and causal re-entry. The architecture separates material persistence, organizational continuity, phenomenal consciousness, personal identity, causal debt and cross-death continuity. The analytic layer contains a locked proof DAG with 31 nodes and 37 edges. The bounded executable layer records 14/14 active test lanes, 12/12 replay records, 4/4 exact-arithmetic traces, 35/35 active proof/certificate checks, 8/8 guard controls and two byte-identical clean runs. The F5R1 verdict is KERNEL_CHECKED within the frozen finite slate. Scope boundary: this release does not establish a universal theorem, does not empirically validate ERBS, does not solve the physical-to-phenomenal bridge and does not prove personal identity across death or reincarnation. Cross-death continuity remains HOLD pending an explicit carrier, encoding, survival boundary, transport route, decoder, identity invariant and discriminating prediction. The deposit includes the master handoff report, active F0–F5R1 formal lineage, F4R2 analytic proof artifact, F5R1 verification dossier, cryptographic checksums and a reproducibility package.