CERBERUS PHYSICS Multi-Resolution Physical Semantics Through Graph-Native Bit Representation Registry-Driven Physical Identity, Independent Resolution Strata, Mirror Graph Integration, and Deliberate Scientific Domain Handoffs v0.1 · Pass 8 Verified Release Represent what must remain distinct. Derive what can be recovered. Reference what is too rich to repeat. Route what belongs elsewhere. Resolve only as deeply as the current question requires. Document Status Field Value Document class Formal architecture / semantic-kernel specification Version v0.1 · Pass 8 Verified Release Scope Common physical semantic joiner and routing architecture Scientific posture Representation of established physical distinctions; not a claim of new physical theory Figure system 36 actual rendered figures built in Pass 6 Bit architecture Reference candidate; widths and ownership remain falsifiable Release status VERIFIED RELEASE — Pass 8 complete Abstract CERBERUS PHYSICS defines a compact graph-native semantic joiner for physical objects, relationships, and state. The architecture begins from stable registry identity, adds only state distinctions that must vary independently, and uses explicit references and domain handoffs rather than attempting to compress all scientific knowledge into one monolithic BitWord. The system is organized into six published semantic strata spanning common physical relations, atomic state, electronic state, nuclear/nucleon state, fundamental-particle state, and quantum/field routing. These strata follow prefix invariance for portable publication while physical resolution itself remains branching and object-dependent. The paper integrates the working CERBERUS SK Reader and experimental Mirror Graph grammar. The SK Reader decodes semantic payload; the Mirror places that payload on Point and Relationship records in versionable graph state; specialist domains extend the same common identities without replacing them. Thirty-six figures and full BitGroup specification cards make the candidate architecture explicit enough to implement, challenge, and falsify. CENTRAL THESIS: Complexity does not have to be embedded where it is used; it only has to remain precisely reachable. Document Spine Part I — Purpose & Representation Law Sections 1–6 Part II — Compression Grammar Sections 7–13 Part III — Registry Semantics Sections 14–19 Part IV — Six-Stratum Architecture Sections 20–25 Part V — PHYSICS¹ — Common Physical Semantics Sections 26–34 Part VI — PHYSICS² — Atomic Identity & State Sections 35–41 Part VII — PHYSICS³ — Electronic / Atomic-Internal State Sections 42–50 Part VIII — PHYSICS⁴ — Nuclear / Nucleon State Sections 51–56 Part IX — PHYSICS⁵ — Fundamental Particle Identity & State Sections 57–65 Part X — PHYSICS⁶ — Quantum / Field Routing Sections 66–75 Part XI — Mirror Graph Reference Sections 76–80 Part XII — Recursive Resolution Sections 81–84 Part XIII — Domain Handoffs Sections 85–89 Part XIV — Worked Examples & Boundary Tests Sections 90–95 Part XV — Non-Collapse Law Sections 96–97 Part XVI — Provisional Bit Family Section 98 Part XVII — Implementation & Falsification Section 99 Part XVIII — Conclusion Section 100 Part I — Purpose & Representation Law PART THESIS: Define the common physical semantic responsibility before allocating Bits. 1. Problem Statement Physical knowledge becomes difficult to reuse when identity, state, representation, graph structure, and domain interpretation are stored as if they were one thing. CERBERUS PHYSICS provides a small common semantic joiner that keeps those responsibilities separate while remaining precise enough to route into richer scientific models. This specification is intentionally architectural. It does not propose new laws of nature. It proposes how established physical distinctions can be represented, addressed, expanded, and tested inside a graph-native semantic system. 2. Scope of the Common Layer The common layer owns stable physical identity, minimum common state, bounded relationship semantics, and explicit routes to registries and specialist domains. It does not attempt to contain organic chemistry, crystallography, nuclear structure, quantum field theory, or numerical simulation in one universal word. A successful common layer therefore has a negative definition as well as a positive one: it is defined partly by what it refuses to own. 3. The Joiner Thesis PHYSICS acts as a common physical ABI: several specialist domains can meet on the same registered object and relationship identities before diverging into their own explanatory grammars. Shared identity is the bridge; domain expertise remains distributed. Figure 1. PHYSICS Is the Joiner PHYSICS establishes shared physical identity and state long enough for specialist domains to meet. It is a joiner, not an encyclopedia. Restraint: Specialist domains are peers connected through shared identity; this is not a hierarchy. 4. Representation Is Not Discovery A semantic representation can be novel while the science it represents remains established. Every field, visual, and routing mechanism in this paper must preserve that boundary. Architectural confidence and scientific-content confidence are tracked separately. Figure 2. Representation Is Not Discovery CERBERUS PHYSICS proposes a way to organize and route established physical distinctions. The proposed encoding architecture is not itself a new physical theory. Restraint: Architectural novelty must never be presented as scientific discovery. 5. Minimum Sufficient Resolution Larger BitWords are not inherently better. The preferred representation resolves only the distinctions required by the current question, preserves routes to deeper state, and avoids copying information that can be deterministically recovered. The governing objective is minimum faithful resolution, not maximum encoded detail. 6. Core Representation Laws The architecture obeys recurring laws: Identity ≠ Address ≠ State; Point ≠ Relationship; Reference ≠ Referenced Contents; Graph Topology ≠ Physical Semantics; Reader Projection ≠ Physical State; Prefix Order ≠ Mandatory Physical Traversal. Core non-collapse grammar Code / value Address Semantic assignment Identity ≠ Address Address ≠ State Point ≠ Relationship Reference ≠ Contents Graph topology ≠ Physical semantics Reader projection ≠ Physical state Prefix order ≠ Physical traversal Part II — Compression Grammar PART THESIS: Choose encoding primitive by semantic question, not convenience. 7. Which One? — SCALAR Selectors A one-of-N identity question is encoded as a scalar selector into a canonical registry. The BitGroup carries the address; the registry carries reusable identity and stable scientific facts. 8. Which Set? — MASK Semantics A mask is appropriate only when several named memberships can be simultaneously true. Reusing a MASK for one-of-N identity wastes width and invites illegal combinations. 9. Magnitude, Reference, Graph, and Handoff Magnitude routes to typed quantitative systems. Large reusable state routes through references. Connectivity belongs to Mirror relationships. Display location belongs to Mirror coordinates. Specialist interpretation belongs to a domain handoff. Figure 3. Compression Decision Grammar One-of-N identity, simultaneous membership, magnitude, reusable state, graph topology, display placement, and specialist interpretation require different mechanisms. Restraint: A field belongs in the common BitWord only if its semantic question cannot be delegated cleanly. 10. Zero, Null, Reserved, and Not Applicable Zero can be a valid physical value. Null means no assertion. Reserved means an address exists but is not assigned. Not Applicable means the semantic dimension does not belong to the selected identity. These states cannot be merged safely. Figure 10. Zero Is Not Unspecified Zero can be meaningful physical state. Unspecified means the representation has made no corresponding assertion. Restraint: Reserved and not-applicable remain additional distinct possibilities. 11. One-of-N Compression The element selector demonstrates the rule: one 7-bit selector is preferable to more than one hundred independent element flags because exactly one element identity is chosen. Figure 4. One-of-N Beats N Flags When exactly one registered identity is selected, a scalar address preserves the distinction more economically than one Boolean flag per possible identity. Restraint: The seven bits address Oxygen; they do not contain its scientific description. 12. Compression by Reachability Semantic compression is not achieved by discarding complexity. It is achieved by keeping a compact exact address to complexity that lives elsewhere. A tiny payload can participate in a large scientific graph without reproducing the graph inside itself. Figure 5. Small Spine, Huge Reach Compact representation does not require compact reachable knowledge. Complexity may remain external so long as the required identity and route remain exact. Restraint: Compression is preserved reachability, not deletion of scientific complexity. 13. Encoding Contract Before Bit Pattern Raw binary does not carry universal meaning. The same pattern may be SCALAR, MASK, signed quantity, registry reference, or another governed encoding. The semantic address includes the BitGroup contract. Figure 6. Selector vs Mask Under SCALAR, positions compose one value. Under MASK, positions may carry independently meaningful memberships. Part III — Registry Semantics PART THESIS: Keep stable reusable identity in registries and mutable condition in instances. 14. Canonical Registry Ownership Registries own stable reusable identities. Atomic identity, particle identity, relation identity, basis identity, operator identity, and similar stable semantic objects are registered once and referenced many times. 15. Instance State Ownership Instance records own state that can vary between two instances of the same registered identity. Neutron count, net charge, occupancy, selected projection, and current referenced state therefore belong to instances rather than the identity registry. 16. Derivation Economy If a property is deterministically recoverable from authoritative fields, it should generally remain derived. Proton count, mass number, and ordinary atomic electron count provide straightforward examples. 17. Exact-Key Resolution The preferred Reader path is deterministic: scoped binary key → scalar/reference address → canonical record → requested projection. Fuzzy semantic search is unnecessary for decoding a correctly addressed BitGroup. Figure 7. Binary → Registry → Meaning The BitGroup is a stable semantic address. The registry supplies the canonical identity and richer description; the Reader supplies the requested projection. Restraint: Binary value, scalar value, registry identity, and projection remain separate objects. 18. Reader Projection One canonical identity may produce several projections: structural symbol, human-readable name, binary code, debug identifier, domain-specific label, or visual asset. Projection changes do not create new physical identity. Figure 8. Identity Facts vs Instance State Stable properties of a selected identity belong to its canonical registry. Properties capable of differing among instances belong to instance state. 19. Scientific Provenance Boundary Semantic key stability does not create scientific authority. Registry records should be capable of linking to sources or authorities that justify their scientific content, while the semantic address remains stable across provenance updates. Figure 9. Derivation Economy When a value can be deterministically recovered from authoritative state, storing it again creates a second potential source of truth. Restraint: Outlined cards indicate derived manifestations, not independently authored source state. Part IV — Six-Stratum Architecture PART THESIS: Publish cumulative semantic strata without pretending reality follows one linear ladder. 20. Six Published Strata The reference architecture publishes six ordered strata: PHYSICS¹ common physical semantics, PHYSICS² atomic state, PHYSICS³ electronic state, PHYSICS⁴ nuclear/nucleon state, PHYSICS⁵ fundamental-particle state, and PHYSICS⁶ quantum/field routing. Field Value PHYSICS¹ Common physical semantics / relationships PHYSICS² Atomic identity and state PHYSICS³ Electronic / atomic-internal state PHYSICS⁴ Nuclear / nucleon state PHYSICS⁵ Fundamental particle identity/state PHYSICS⁶ Quantum / field routing 21. Prefix Invariance A published higher-resolution word extends lower-resolution semantics without moving or redefining the published prefix. Once a stable address is released, later growth occurs by extension and routing rather than reinterpretation. 22. Prefix Order Is Not Ontology The cumulative publication order is a portability grammar. It is not a claim that every physical object literally contains or traverses every preceding stratum. Electrons, photons, atoms, and nuclei have different legitimate resolution paths. Figure 11. Six-Stratum Resolution Architecture PHYSICS publishes ordered semantic strata, but physical resolution is not one mandatory containment ladder. Different objects branch, terminate, or enter at different strata. Restraint: PREFIX ORDER ≠ MANDATORY PHYSICAL TRAVERSAL · DEEPER ≠ BETTER 23. Independent Stratum Decoding Each stratum must be independently decodable when its surrounding graph context is explicit. This lets Mirror records carry the locally relevant state slice instead of repeating the full portable prefix at every child node. Figure 12. Independent Strata A PHYSICS stratum can be independently decoded when the surrounding graph already supplies the necessary ancestry and identity context. Restraint: STRATUM SLICE ≠ ENTIRE PORTABLE PHYSICS WORD 24. Portable Word vs Contextual Slice Portable exchange favors self-contained cumulative words. Graph-local storage can be more economical because ancestry already supplies identity and scope. Context compression is valid only when that ancestry is explicit and stable. Figure 13. Portable Word vs Contextual Slice Portable encoding may carry cumulative prefix context. Inside an explicit Mirror graph, ancestry can already provide that context, allowing a record to carry only the locally relevant stratum. Restraint: Contextual slices are an optimization surface, not permission to violate canonical prefix invariance. 25. Resolution Is a Question-Driven Operation Resolution is chosen by the task. Walking through a scene may require geometry and coarse object identity; a nanoscopic operation may require atomic or electronic resolution. Deeper state is neither automatically truer nor automatically more relevant. Part V — PHYSICS¹ — Common Physical Semantics PART THESIS: Build the common relation surface while aggressively attacking fields that belong elsewhere. 26. PHYSICS¹ Reference Candidate Ledger PHYSICS¹ is the least-settled stratum because it tries to capture common physical relationship semantics across several scientific families. The current ~26-bit label is a reference-candidate target region, not a reconciled final sum of every surfaced candidate field. The sections that follow therefore distinguish core candidate groups from fields under explicit elimination or relocation pressure. Field Value Current label PHYSICS¹ ≈26 bits — historical/reference candidate Core candidate groups Relation Type; Order; State; Endpoint Polarity A; Endpoint Polarity B Under attack Process Class; Phase/Regime Likely metadata Physical Entity Class; Relation Family Arithmetic status Not reconciled; the label is not a canonical inventory sum Figure 14. PHYSICS¹ Candidate Surface PHYSICS¹ is a pre-implementation candidate, not a frozen word. Fields remain only if testing demonstrates that the common physical layer must own them. Restraint: Amber fields are implementation targets, not settled canon. 27. Relationship Type Relationship Type is the primary one-of-N selector for the common relation surface. Its scientific safety depends on registry family metadata so chemical, force/field, contact, and transfer relations are not flattened into one explanatory taxonomy. 1. Canonical BitGroup name Relationship Type 2. Semantic question answered Which registered common physical relationship identity is being asserted? 3. Owning stratum PHYSICS¹ — Common Physical Semantics 4. Point / Relationship applicability Relationship records 5. Encoding primitive SCALAR selector 6. Provisional width 6 bits — reference candidate 7. Binary / value range 64 addresses (0–63) 8. Null / unspecified behavior Address 0 is the current null/unspecified candidate. A relationship record may also be absent entirely when no relation is asserted. 9. Reserved values Addresses 9–63 are currently unassigned and remain registry capacity. 10. Registry / calculation route Exact binary key or decoded scalar value → Physical Relation Registry → stable relation identity + family metadata + Reader projections. 11. Stable identity vs variable state Stable relation identity selector; not relation strength, process, or event state. 12. Derived properties Relation Family and structural symbol can be registry-derived. Domain-specific parameters are not duplicated here. 13. Reader interpretation Decode one relation identity, then project a structural symbol or domain route appropriate to the selected Reader. 14. Visual projection Relationship carrier with relation-family texture or symbol; family metadata prevents a false single scientific taxonomy. 15. Valid domain handoffs Chemistry, mechanics, electromagnetism, thermodynamics, materials, specialist interaction models. 16. Worked example 000010 → scalar 2 → Ionic. 17. Non-collapse distinctions Relation Type ≠ Relation Order ≠ Relation Strength ≠ Relation State ≠ Process ≠ Event. 18. Known limitations The current candidate list spans explanatory levels. Relation Family metadata is therefore required, and the registry will need expert review. 19. Implementation test Attempt to encode covalent, ionic, gravitational, electrical, magnetic, contact, and thermal examples without type confusion; verify exact Reader lookup. 20. Revision status REFERENCE CANDIDATE — DOMAIN REVIEW REQUIRED Published value mapping Code / value Address Semantic assignment 000000 0 Unspecified / null candidate 000001 1 Covalent / molecular bonding 000010 2 Ionic 000011 3 Metallic 000100 4 Gravitational 000101 5 Electrical 000110 6 Magnetic 000111 7 Mechanical contact / constraint 001000 8 Thermal coupling 001001–111111 9–63 Reserved for registered relation identities STATUS: REFERENCE CANDIDATE — DOMAIN REVIEW REQUIRED 28. Relationship Order / Multiplicity Order is a separate attribute from identity and is only meaningful where the selected relation type defines such a dimension. Applicability is part of the contract, not an afterthought. 1. Canonical BitGroup name Relationship Order / Multiplicity 2. Semantic question answered What multiplicity or order does this relationship carry where that dimension is scientifically meaningful? 3. Owning stratum PHYSICS¹ 4. Point / Relationship applicability Relationship records whose selected Relation Type defines an order/multiplicity dimension 5. Encoding primitive SCALAR selector 6. Provisional width 3 bits — reference candidate 7. Binary / value range 8 addresses (0–7) 8. Null / unspecified behavior 000 = no order asserted / not supplied. Applicability must be checked separately. 9. Reserved values 111 reserved. 10. Registry / calculation route Decode locally; Relation Type Registry determines whether the dimension is applicable and how to interpret the value. 11. Stable identity vs variable state Variable relation attribute; not identity. 12. Derived properties Reader may derive line multiplicity for structural views. 13. Reader interpretation Render single/double/triple or distributed relation only for applicable relation types. 14. Visual projection Line multiplicity or distributed-band projection. 15. Valid domain handoffs Chemistry and any specialist relation model that defines a meaningful multiplicity dimension. 16. Worked example Covalent + order 2 → double-bond structural projection. 17. Non-collapse distinctions Relation Type ≠ Relation Order; order for a covalent bond does not imply that gravitational relations have “double” or “triple” forms. 18. Known limitations The candidate vocabulary is intentionally broad. Some values may migrate to specialist registries after implementation tests. 19. Implementation test Run applicability tests across chemical and non-chemical relation types; any nonsensical universal interpretation is a failure. 20. Revision status REFERENCE CANDIDATE — APPLICABILITY-GOVERNED Published value mapping Code / value Address Semantic assignment 000 0 Unspecified / not asserted 001 1 Single 010 2 Double 011 3 Triple 100 4 Quadruple 101 5 Multiple / composite 110 6 Continuous / distributed 111 7 Reserved STATUS: REFERENCE CANDIDATE — APPLICABILITY-GOVERNED Figure 15. Relation Type ≠ Relation Order Relationship identity and relationship order answer different questions. Order is meaningful only where the selected relationship type defines such a dimension. Restraint: Do not force chemical bond-order semantics onto unrelated physical relations. 29. Relationship State Relationship State is retained as a falsifiable candidate for persistent relation condition. The field must be deleted or narrowed if forming, breaking, transient, or similar values prove to belong primarily to Process or Event ownership. 1. Canonical BitGroup name Relationship State 2. Semantic question answered What persistent state does the selected relationship currently occupy? 3. Owning stratum PHYSICS¹ 4. Point / Relationship applicability Relationship records when a persistent state distinction is required 5. Encoding primitive SCALAR selector 6. Provisional width 3 bits — reference candidate 7. Binary / value range 8 addresses (0–7) 8. Null / unspecified behavior 000 = unspecified. 9. Reserved values No permanently reserved code in the current sketch; 111 remains the most likely revision point. 10. Registry / calculation route Decode locally; Relation Type and domain metadata constrain legal meanings. 11. Stable identity vs variable state Variable relation state. 12. Derived properties Event history may be derived from separate Event records; it must not be inferred solely from relation state. 13. Reader interpretation Project stable/forming/breaking/etc. only when the relation model supports the distinction. 14. Visual projection Stable solid line, forming dashed line, breaking strike, oscillating wave; projection only. 15. Valid domain handoffs Operators, Processes, Events, chemistry, materials, dynamics. 16. Worked example A covalent relationship can be structurally present while its state is marked forming during a modeled process. 17. Non-collapse distinctions Relation State ≠ Process ≠ Event. “Breaking” as a state label cannot replace the event that produced the change. 18. Known limitations Several values risk collapsing process semantics. This group is retained only as a falsifiable common-core candidate. 19. Implementation test Attempt to move forming/breaking/transient semantics into Process/Event ownership; remove the BitGroup if no common persistent state remains. 20. Revision status REFERENCE CANDIDATE — ELIMINATION PRESSURE Published value mapping Code / value Address Semantic assignment 000 0 Unspecified 001 1 Stable 010 2 Forming 011 3 Breaking 100 4 Oscillating 101 5 Transient 110 6 Intermittent 111 7 Constrained / unresolved candidate STATUS: REFERENCE CANDIDATE — ELIMINATION PRESSURE 30. Endpoint Polarity A Endpoint A Polarity is a qualitative projection semantic. It offers rapid visual interpretation while preserving exact charge and field quantities elsewhere. 1. Canonical BitGroup name Endpoint Polarity A 2. Semantic question answered What qualitative signed polarity class is projected at endpoint A? 3. Owning stratum PHYSICS¹ 4. Point / Relationship applicability Relationship endpoint projection where a bounded qualitative polarity class is useful 5. Encoding primitive SCALAR selector 6. Provisional width 3 bits 7. Binary / value range Seven signed classes plus unspecified 8. Null / unspecified behavior 111 = unspecified/reserved. 000 is meaningful neutral/zero, not null. 9. Reserved values 111 currently serves as unspecified/reserved. 10. Registry / calculation route Decode directly; exact electric charge and field quantities route to typed quantitative systems. 11. Stable identity vs variable state Variable endpoint projection; not stable particle charge identity. 12. Derived properties Color/shape Reader projection is derived from signed class. 13. Reader interpretation Render +3 red, +2 orange, +1 yellow, 0 white, -1 purple, -2 blue, -3 green, always with a numeric label. 14. Visual projection Signed label + semantic color; gradients indicate static bias, arrows indicate actual process. 15. Valid domain handoffs Electromagnetism, chemistry, electrostatics, materials, quantity systems. 16. Worked example Endpoint A = +1 can be paired with the complementary endpoint = -1 while exact charge remains elsewhere. 17. Non-collapse distinctions Polarity Class ≠ Exact Electric Charge ≠ Oxidation State ≠ QCD Color Charge. 18. Known limitations A seven-class scale is qualitative. It must never substitute for a continuous field or exact charge quantity. 19. Implementation test Compare projection against exact charge/field values and verify that zero and unspecified remain distinguishable. 20. Revision status REFERENCE CANDIDATE — PROJECTION SEMANTIC Published value mapping Code / value Address Semantic assignment 000 0 Neutral / zero 001 +1 Positive class +1 010 +2 Positive class +2 011 +3 Positive class +3 100 -1 Negative class -1 101 -2 Negative class -2 110 -3 Negative class -3 111 — Unspecified / reserved STATUS: REFERENCE CANDIDATE — PROJECTION SEMANTIC 31. Endpoint Polarity B Endpoint B Polarity mirrors the Endpoint A grammar so asymmetric relation bias can be shown without turning the visual palette into an exact physical quantity. 1. Canonical BitGroup name Endpoint Polarity B 2. Semantic question answered What qualitative signed polarity class is projected at endpoint B? 3. Owning stratum PHYSICS¹ 4. Point / Relationship applicability Relationship endpoint projection where a bounded qualitative polarity class is useful 5. Encoding primitive SCALAR selector 6. Provisional width 3 bits 7. Binary / value range Seven signed classes plus unspecified 8. Null / unspecified behavior 111 = unspecified/reserved. 000 is meaningful neutral/zero, not null. 9. Reserved values 111 currently serves as unspecified/reserved. 10. Registry / calculation route Decode directly; exact electric charge and field quantities route to typed quantitative systems. 11. Stable identity vs variable state Variable endpoint projection; not stable particle charge identity. 12. Derived properties Color/shape Reader projection is derived from signed class. 13. Reader interpretation Render +3 red, +2 orange, +1 yellow, 0 white, -1 purple, -2 blue, -3 green, always with a numeric label. 14. Visual projection Signed label + semantic color; gradients indicate static bias, arrows indicate actual process. 15. Valid domain handoffs Electromagnetism, chemistry, electrostatics, materials, quantity systems. 16. Worked example Endpoint B = +1 can be paired with the complementary endpoint = -1 while exact charge remains elsewhere. 17. Non-collapse distinctions Polarity Class ≠ Exact Electric Charge ≠ Oxidation State ≠ QCD Color Charge. 18. Known limitations A seven-class scale is qualitative. It must never substitute for a continuous field or exact charge quantity. 19. Implementation test Compare projection against exact charge/field values and verify that zero and unspecified remain distinguishable. 20. Revision status REFERENCE CANDIDATE — PROJECTION SEMANTIC Published value mapping Code / value Address Semantic assignment 000 0 Neutral / zero 001 +1 Positive class +1 010 +2 Positive class +2 011 +3 Positive class +3 100 -1 Negative class -1 101 -2 Negative class -2 110 -3 Negative class -3 111 — Unspecified / reserved STATUS: REFERENCE CANDIDATE — PROJECTION SEMANTIC Figure 16. Polarity Spectrum The seven-state polarity palette is a compact Reader-facing semantic projection. It does not replace exact electric charge, oxidation state, electrostatic potential, or QCD color charge. Restraint: Color is always paired with a signed numeric label. 32. Process Class — Candidate Under Attack A universal Process Class inside PHYSICS¹ currently fails the ownership test. The preferred architecture represents persistent relation state, reusable process/operator identity, and specific event occurrence as separate objects. 1. Canonical BitGroup name Process Class 2. Semantic question answered Should the common relation payload encode what transformation/process is occurring? 3. Owning stratum PHYSICS¹ — candidate under attack 4. Point / Relationship applicability Originally imagined for relationships; ownership is disputed 5. Encoding primitive Historical SCALAR candidate 6. Provisional width 4 bits — historical sketch only 7. Binary / value range 16 addresses were proposed; no values are published 8. Null / unspecified behavior No null policy is locked because the group itself is not accepted. 9. Reserved values All addresses effectively uncommitted. 10. Registry / calculation route Preferred route is Relation State → Operator/Process object → Event occurrence, not a universal in-band process selector. 11. Stable identity vs variable state Would be dynamic/process semantics, which argues against common relation ownership. 12. Derived properties None should be derived from this field while the group is under attack. 13. Reader interpretation No canonical Reader projection. 14. Visual projection Amber candidate / attack card only. 15. Valid domain handoffs Operator, Process, Event, chemistry, dynamics. 16. Worked example Heat-transfer process should not be collapsed into the existence of a thermal coupling relationship. 17. Non-collapse distinctions Relation ≠ Process ≠ Event. 18. Known limitations Strong ownership conflict and high risk of semantic collapse. 19. Implementation test Try to model all candidate examples using Relation State + Operator/Process + Event. If successful, delete this group. 20. Revision status ELIMINATION TARGET — NOT ADMITTED TO v0.1 COMMON CORE STATUS: ELIMINATION TARGET — NOT ADMITTED TO v0.1 COMMON CORE 33. Physical Phase / Regime — Candidate Under Attack Solid, liquid, gas, plasma, and similar labels may be scientifically useful, but usefulness alone does not prove common-core ownership. Materials and thermodynamic systems are the likely owners unless implementation repeatedly demonstrates a domain-independent need. 1. Canonical BitGroup name Physical Phase / Regime 2. Semantic question answered Should the common PHYSICS relation/object payload own solid/liquid/gas/plasma or similar regime classification? 3. Owning stratum PHYSICS¹ — candidate under attack 4. Point / Relationship applicability Object/material state only if a genuine universal common need is demonstrated 5. Encoding primitive Historical SCALAR candidate 6. Provisional width 4 bits — historical sketch only 7. Binary / value range 16 addresses were discussed; no canonical mapping is published 8. Null / unspecified behavior Not locked. 9. Reserved values Not locked. 10. Registry / calculation route Likely route to Materials, Thermodynamics, or a derived specialist state. 11. Stable identity vs variable state Variable material/thermodynamic state. 12. Derived properties May be derived from specialist state under specified conditions. 13. Reader interpretation No canonical common Reader projection beyond an amber candidate badge. 14. Visual projection Candidate phase badges. 15. Valid domain handoffs Materials science, thermodynamics, plasma physics, fluid systems. 16. Worked example Water may be liquid, but “liquid” is not necessarily a universal PHYSICS primitive needed by every physical object. 17. Non-collapse distinctions Physical identity ≠ material phase; phase ≠ complete thermodynamic state. 18. Known limitations Likely domain leakage if kept universally. 19. Implementation test Attempt to satisfy all common examples through domain handoff; keep only if repeated cross-domain need cannot be represented cleanly elsewhere. 20. Revision status ELIMINATION / RELOCATION TARGET STATUS: ELIMINATION / RELOCATION TARGET 34. Physical Entity Class — Likely Metadata Entity family classification is probably derivable from the selected registry identity. Adding a universal BitGroup for atom/molecule/particle/body/etc. risks duplicating metadata already known by the registry. 1. Canonical BitGroup name Physical Entity Class 2. Semantic question answered Does a common object require an in-band class such as atom, molecule, particle, body, field, or relation? 3. Owning stratum PHYSICS¹ — candidate metadata 4. Point / Relationship applicability Point records if a common entity-class discriminator proves necessary 5. Encoding primitive Not locked; likely registry metadata rather than BitGroup 6. Provisional width Not locked 7. Binary / value range Not locked 8. Null / unspecified behavior Not locked. 9. Reserved values Not locked. 10. Registry / calculation route Preferred route is registry identity → entity-family metadata. 11. Stable identity vs variable state Stable classification metadata, not variable physical state. 12. Derived properties Likely derivable from the selected registry identity. 13. Reader interpretation Could label object families for navigation without adding payload bits. 14. Visual projection Family badge only. 15. Valid domain handoffs All specialist domains. 16. Worked example Element selector already implies an atomic identity; an additional “atom” Bit may be redundant. 17. Non-collapse distinctions Entity Class ≠ Exact Identity; classification ≠ object. 18. Known limitations High redundancy risk. 19. Implementation test Remove the field and test whether registry metadata is sufficient for all Readers and routing decisions. 20. Revision status CANDIDATE — LIKELY REGISTRY METADATA STATUS: CANDIDATE — LIKELY REGISTRY METADATA Part VI — PHYSICS² — Atomic Identity & State PART THESIS: Represent atomic identity, isotope distinction, and ion state with minimum independent fields. 35. PHYSICS² Atomic Contract PHYSICS² answers the minimum common questions needed to distinguish an atomic instance from its stable element identity: which element, how many neutrons, and what net integral electric charge. Field Value Element Selector 7 bits Neutron Count 8 bits Net Electric Charge 8 bits Increment +23 bits Cumulative reference label PHYSICS² ≈49 Figure 17. PHYSICS² Atomic Payload PHYSICS² stores only the common atomic distinctions that must vary independently. Stable elemental facts and deterministically recoverable values remain registry-derived or calculated. Restraint: Exact electronic state belongs at deeper resolution, not inside PHYSICS². 36. Element Selector The Element selector is the strongest early compression result in the paper: seven bits address all currently recognized elements while leaving stable elemental facts in a canonical registry. 1. Canonical BitGroup name Element Selector 2. Semantic question answered Which chemical element identity does this atomic Point instantiate? 3. Owning stratum PHYSICS² — Atomic Identity & State 4. Point / Relationship applicability Atomic Point / atom instance 5. Encoding primitive SCALAR selector into Atom / Element Registry 6. Provisional width 7 bits 7. Binary / value range 128 addresses; direct values 1–118 currently assigned to recognized elements 8. Null / unspecified behavior 0000000 is the provisional null/unspecified address. This policy remains implementation-governed. 9. Reserved values 119–127 are unassigned address capacity, not asserted future elements. 10. Registry / calculation route Exact key → Element Registry → stable facts such as name, symbol, atomic number, period, group. 11. Stable identity vs variable state Stable identity selector. 12. Derived properties Proton count = atomic number; element name/symbol and stable facts are registry-derived. 13. Reader interpretation Project symbol, name, structural token, binary key, or debug ID without changing identity. 14. Visual projection Bounded atom ring with element symbol; ring is an object enclosure, not an electron orbit. 15. Valid domain handoffs Chemistry, materials, spectroscopy, biology, nuclear/atomic domains. 16. Worked example 0001000 → 8 → Oxygen. 17. Non-collapse distinctions Element ≠ Atom Instance ≠ Isotope ≠ Ion ≠ Electronic State. 18. Known limitations The selector is adequate for present element registry size but does not encode isotope, charge, or electron state. 19. Implementation test Round-trip all assigned values 1–118 and confirm exact lookup; verify 119–127 do not resolve to invented element identities. 20. Revision status REFERENCE CANDIDATE — STRONG Published value mapping Code / value Address Semantic assignment 0000000 0 Provisional null / unspecified address 0000001–1110110 1–118 Direct registry address: H through Og 1110111–1111111 119–127 Unassigned address capacity STATUS: REFERENCE CANDIDATE — STRONG Figure 18. Seven Bits Address the Element Registry Seven binary positions provide 128 possible addresses, sufficient for the 118 presently recognized elements. Unused addresses are representation capacity, not scientific claims. Restraint: Address 0 and 119–127 remain governed selector-policy questions until implementation locks them. 37. Neutron Count Neutron count creates isotope distinction without inventing a separate isotope identity registry for every atomic instance. Zero neutrons remains a legitimate value and therefore cannot serve as null. 1. Canonical BitGroup name Neutron Count 2. Semantic question answered How many neutrons does this atomic instance contain? 3. Owning stratum PHYSICS² 4. Point / Relationship applicability Atomic instance / nucleus parent state 5. Encoding primitive Unsigned SCALAR 6. Provisional width 8 bits 7. Binary / value range 0–255 neutrons 8. Null / unspecified behavior No in-band null: zero is physically meaningful. Unspecified must be represented by absent/unresolved state outside this numeric value. 9. Reserved values None in the direct 0–255 range. 10. Registry / calculation route Decode directly; isotope notation and mass number are derived with Element/atomic number. 11. Stable identity vs variable state Variable atomic state. 12. Derived properties Mass number A = Z + N; isotope label derives from Element + N. 13. Reader interpretation Return integer neutron count and derived isotope notation when requested. 14. Visual projection Numeric state card; not one visible neutron icon per count unless nucleus is explicitly hydrated. 15. Valid domain handoffs Nuclear physics, isotope chemistry, mass/quantity systems. 16. Worked example Oxygen with N=10 → Oxygen-18. 17. Non-collapse distinctions Neutron Count ≠ Mass Number ≠ Atomic Number. 18. Known limitations 255 is a representation bound, not a physical law. Objects outside the common envelope force width revision or specialist routing. 19. Implementation test Verify N=0 remains representable and never collapses into unspecified; stress values near 255. 20. Revision status REFERENCE CANDIDATE — STRONG STATUS: REFERENCE CANDIDATE — STRONG 38. Net Electric Charge Net electric charge differentiates neutral atoms and ions while remaining independent from isotope. A signed numeric encoding is preferable to a qualitative polarity palette at this layer. 1. Canonical BitGroup name Net Electric Charge 2. Semantic question answered What is the atom instance’s net integral electric charge in elementary-charge units? 3. Owning stratum PHYSICS² 4. Point / Relationship applicability Atomic instance 5. Encoding primitive Signed SCALAR 6. Provisional width 8 bits — reference candidate 7. Binary / value range Candidate two’s-complement range -128…+127 e 8. Null / unspecified behavior No in-band null: 0 is meaningful neutral charge. Unspecified state must remain external to the numeric value. 9. Reserved values None if standard signed-integer mapping is used. 10. Registry / calculation route Decode directly; electron count derives as Z - Q when Q is expressed in units of +e. 11. Stable identity vs variable state Variable atomic state. 12. Derived properties Electron count from atomic number and net charge for ordinary atomic ions. 13. Reader interpretation Return signed integer charge and formatted ionic notation. 14. Visual projection Exact signed quantity card; qualitative polarity is a separate projection. 15. Valid domain handoffs Electromagnetism, chemistry, spectroscopy, quantitative unit systems. 16. Worked example Oxygen Z=8 with Q=-2 → 10 electrons and O-18^2- when N=10. 17. Non-collapse distinctions Net Electric Charge ≠ Polarity Class ≠ Oxidation State. 18. Known limitations The bounded common field targets integral atomic ion charge. Fractional effective charges or larger ranges route elsewhere. 19. Implementation test Round-trip negative, zero, and positive values; verify neutrality is not treated as unspecified. 20. Revision status REFERENCE CANDIDATE — IMPLEMENTATION MAPPING TO LOCK STATUS: REFERENCE CANDIDATE — IMPLEMENTATION MAPPING TO LOCK 39. Element, Isotope, Ion, and State Element identity, neutron count, net charge, and electronic condition are orthogonal enough to require independent representation. The same Oxygen identity can therefore appear as multiple isotopes, ions, and electronic states. Figure 19. Element ≠ Isotope ≠ Ion ≠ Atomic State Atomic identity persists while neutron count, net charge, and electronic condition vary independently. Changing one does not necessarily change the others. Restraint: Oxygen-18 is not a different element from Oxygen. 40. Derived Atomic Facts Atomic number and proton count come from the Element registry. Mass number derives from Z + N. Ordinary atomic electron count derives from Z - Q under the signed charge convention. These remain Reader results rather than second sources of truth. 41. Atomic Resolution Boundary PHYSICS² deliberately stops before exact electronic configuration. It preserves the ability to descend into PHYSICS³ or into a specialist atomic model when the current task requires that detail. Part VII — PHYSICS³ — Electronic / Atomic-Internal State PART THESIS: Resolve electronic detail selectively and validate physical legality separately from bit decodability. 42. PHYSICS³ Electronic Contract PHYSICS³ introduces a compact electronic system: a reusable configuration reference and bounded orbital-state descriptors sufficient for common atomic-internal resolution. The layer is intentionally not a substitute for a complete many-electron wavefunction. Field Value Electron Configuration Ref 12 bits n 4 bits l 3 bits m 4 bits Occupancy 2 bits Electron Spin Projection 2 bits Increment +27 bits Cumulative reference label PHYSICS³ ≈76 Figure 20. Selective Electronic Hydration Electronic detail may remain referenced until explicit orbital or electron state is required. Hydration increases represented resolution without changing the parent atom's identity. Restraint: Orbital-state diagrams are not electron trajectories. 43. Electron Configuration Reference Configuration references support cheap default state and selective hydration. A common atom can remain compact until a Reader needs to expose explicit orbital records. 1. Canonical BitGroup name Electron Configuration Reference 2. Semantic question answered Which reusable electron-configuration state should this atomic electronic system use as its compact starting representation? 3. Owning stratum PHYSICS³ — Electronic / Atomic-Internal State 4. Point / Relationship applicability Electronic-system Point or atomic child context 5. Encoding primitive Registry reference 6. Provisional width 12 bits 7. Binary / value range 4096 addresses 8. Null / unspecified behavior 0 = no configuration reference asserted. 9. Reserved values Registry governs unassigned addresses; 1–4095 available for records. 10. Registry / calculation route Reference → Electron Configuration Registry / state object. 11. Stable identity vs variable state Variable state reference; may point to ground, excited, ion-specific, or domain-defined configuration records. 12. Derived properties Reader may derive occupancy summaries from the referenced configuration. 13. Reader interpretation Return configuration notation or expand into explicit orbital records when hydrated. 14. Visual projection Compact ECON-### token or orbital occupancy display. 15. Valid domain handoffs Atomic physics, spectroscopy, quantum chemistry, QSTATE. 16. Worked example ECON-008 may project 1s² 2s² 2p⁴ for neutral oxygen ground configuration. 17. Non-collapse distinctions Configuration Reference ≠ Complete Wavefunction ≠ Orbital Geometry. 18. Known limitations Reference capacity is an architectural choice; complex correlated state may need deeper QSTATE routing. 19. Implementation test Resolve known configuration records exactly, hydrate selected orbitals, and verify no duplicate source truth. 20. Revision status REFERENCE CANDIDATE — STRONG STATUS: REFERENCE CANDIDATE — STRONG 44. Principal Quantum Number n The current candidate intentionally bounds the common envelope to n=1…8. Higher-n states are not impossible; they are explicit tests of whether the common width should expand or route to a richer specialist state. 1. Canonical BitGroup name Principal Quantum Number n 2. Semantic question answered What principal quantum number is assigned to the selected orbital state? 3. Owning stratum PHYSICS³ 4. Point / Relationship applicability Orbital-state record 5. Encoding primitive Bounded SCALAR 6. Provisional width 4 bits 7. Binary / value range Candidate common envelope n = 1…8; additional codes reserved 8. Null / unspecified behavior 0000 = unspecified / no orbital state asserted. 9. Reserved values 1001–1111 reserved. They are not values n=9…15 in this v0.1 candidate. 10. Registry / calculation route Decode locally; values outside the common envelope route to specialist state or force width revision. 11. Stable identity vs variable state Variable orbital-state descriptor. 12. Derived properties Constrains legal l values. 13. Reader interpretation Display n as an integer state descriptor. 14. Visual projection Orbital state card, not a spatial shell radius. 15. Valid domain handoffs Atomic physics, spectroscopy, quantum chemistry, QSTATE. 16. Worked example n=2 permits l=0 or 1. 17. Non-collapse distinctions n ≠ orbital geometry ≠ energy by itself. 18. Known limitations Principal quantum number is physically unbounded in principle; n≤8 is a deliberate common-layer envelope, not a scientific maximum. 19. Implementation test Stress Rydberg/high-n examples; if common use requires n>8, widen or route. 20. Revision status REFERENCE CANDIDATE — BOUNDED COMMON ENVELOPE Published value mapping Code / value Address Semantic assignment 0000 — Unspecified / no orbital state asserted 0001–1000 1–8 Principal quantum number n = 1…8 1001–1111 9–15 Reserved; route deeper or revise width if needed STATUS: REFERENCE CANDIDATE — BOUNDED COMMON ENVELOPE 45. Orbital Angular Momentum Quantum Number l The 3-bit l field is coherent with the n≤8 common envelope because the legal maximum l is seven. Validity remains conditional on l