````text ============================================================ TENET MACHINA EX ROTA AGLA / MACHINE STACK — PRINCIPIAL LAW OF ROTA-TO-MACHINE EXTRACTION Version: 0.1.0-TENET-MACHINA-EX-ROTA Status: DRAFT — PRINCIPIAL MACHINE-EXTRACTION TENET Authority: USER / HUMAN CONTROL PLANE LOCAL CONTROL PLANE — GENERAL AGLA / KABBALAH STACK Class: AGLA / TENET / MACHINA / EX_ROTA / EXTRACTION / MACHINE_TRANSLATION / NON_COLLAPSE Depends-On: • LIBER MACHINA EX ROTAE EXTRACTIO v0.1.0 • ROTA NETIVOT v0.1.1 • TENET SEPHIROT v0.3.0 • ROTA SEPHIROT ARBOR v0.2.0 Scope: • define principial laws for extracting machine-state from ROTA artifacts • establish ROTA as traversable machine object • preserve ROTA / WHEEL / CASA / OPERATOR / PLACEMENT distinction • preserve TENET / ROTAS / AREPO / OPERA / SATOR class separation • define machine extraction as representation layer, not OPERA execution • define order pluralism as principial law • define carrier package necessity • define visual / admission / execution state separation • prevent schema artifacts from becoming canon by themselves Mutation Policy: VERSION-CONTROLLED ONLY ============================================================ ============================================================ 0. PATCH STATUS ============================================================ This TENET is generated after: LIBER MACHINA EX ROTAE EXTRACTIO v0.1.0 The LIBER defined the draft extraction substrate and schema-governance requirements for translating textual ROTAS-class artifacts into machine-state structures, while preserving source trace, order pluralism, carrier packages, state separation, loci, cameras, chambers, multiplicatio, and validation boundaries. :contentReference[oaicite:0]{index=0} This TENET now extracts the principial layer: what must be true for machine extraction from ROTA to be lawful. It does not yet define: AREPO admission OPERA execution ROTA implementation SATOR mediation Those are deferred to the next pentagram artifacts. ============================================================ I. PURPOSE ============================================================ TENET MACHINA EX ROTA defines the principial laws governing the translation of ROTA artifacts into machine-state representations. Its purpose is to ensure that when AGLA structures are parsed into software-facing forms, they do not suffer structural collapse. The target problem: textual AGLA artifacts need to become machine-readable state without becoming: • arbitrary JSON • visual-only diagrams • hidden OPERA execution • canonical mutation • symbolic flattening • operator/slot collapse • UI-state confusion • source-free inference Therefore: MACHINE EXTRACTION = controlled representation of structure not: execution validation canonization interpretation by itself ============================================================ II. CORE PRINCIPLE ============================================================ ============================================================ MACHINA EX ROTA — CORE LAW ============================================================ A ROTA may be translated into machine-state only if the translation preserves its structural distinctions. The machine representation may encode: • wheels • houses • operators • placements • connections • traversals • loci • cameras • chambers • visual bindings • source traces • state models • validation rules But the machine representation may not collapse these into one another. ============================================================ Compressed: encode structure do not replace structure Formula: ROTA_TEXT → extraction → MACHINE_STATE not: MACHINE_STATE → defines ROTA_TEXT ============================================================ III. PRIMARY DEFINITIONS ============================================================ ------------------------------------------------------------ III.1 MACHINA ------------------------------------------------------------ MACHINA is: a machine-readable state representation of a structured AGLA object. In this domain: MACHINA = formal representation layer capable of validation, traversal, visualization, and later controlled execution handoff. MACHINA is not: • canon • OPERA • AREPO • SATOR • source text • ontology • final interpretation ------------------------------------------------------------ III.2 MACHINA EX ROTA ------------------------------------------------------------ MACHINA EX ROTA is: machine-state extracted from a ROTA artifact. Formal: MACHINA_EX_ROTA = parsed ROTA structure + source trace + non-collapse constraints + validation surface + optional visual binding + admission/execution readiness markers It is not: ROTA itself. The extracted machine is a representation of the ROTA, not the ROTA’s authority source. ------------------------------------------------------------ III.3 ROTA ------------------------------------------------------------ ROTA is: a traversable machine object belonging to ROTAS. ROTA may contain: • WHEELS • CASAE • OPERATOR placements • traversal topology • connection graph • display order • structural order • visual binding ROTA NETIVOT v0.1.1 already stabilizes the relevant taxonomy: ROTA is machine object, WHEEL is annular component, CASA is local slot, OPERATOR is later placed content, and VISUAL_BINDING is optional representation rather than execution. :contentReference[oaicite:1]{index=1} ------------------------------------------------------------ III.4 WHEEL ------------------------------------------------------------ WHEEL is: an annular or wheel-like positional component inside a ROTA. It names the annular component and avoids the 3D mesh taxonomy collision. ------------------------------------------------------------ III.5 CASA / HOUSE ------------------------------------------------------------ CASA / HOUSE is: a local positional slot inside a WHEEL. CASA is the correct structural anchor for visual placement. Therefore: visual node → house_ref not: visual node → operator_ordinal ------------------------------------------------------------ III.6 OPERATOR ------------------------------------------------------------ OPERATOR is: operative or symbolic content allocated to a CASA by explicit PLACEMENT. OPERATOR is not identical to the CASA it occupies. Operator ordinal is not identical to house ordinal by default. ------------------------------------------------------------ III.7 PLACEMENT ------------------------------------------------------------ PLACEMENT is: the explicit binding of OPERATOR to CASA. It is the main anti-collapse table. Every lawful placement must preserve: operator_ref wheel_ref house_ref operator_ordinal house_ordinal ordinal_relation ------------------------------------------------------------ III.8 CONNECTION ------------------------------------------------------------ CONNECTION is: a traversable relation between structural references. It may connect houses, placements, wheels, loci, cameras, chambers, or other admitted structural units. ------------------------------------------------------------ III.9 VISUAL_BINDING ------------------------------------------------------------ VISUAL_BINDING is: an optional representation layer. It may produce: • Godot nodes • web nodes • SVG elements • 2D coordinates • 3D coordinates • camera surfaces • UI selections But: visual binding does not execute OPERA. This law is inherited directly from the ROTA extraction substrate. :contentReference[oaicite:2]{index=2} ============================================================ IV. NON-COLLAPSE AXIOM ============================================================ The central axiom of TENET MACHINA EX ROTA is: ```text ROTA ≠ WHEEL WHEEL ≠ CASA CASA ≠ OPERATOR OPERATOR ≠ PLACEMENT PLACEMENT ≠ CONNECTION CONNECTION ≠ TRAVERSAL TRAVERSAL ≠ EXECUTION VISUAL_BINDING ≠ EXECUTION VISUAL_SELECTION ≠ AREPO_ADMISSION AREPO_ADMISSION ≠ OPERA_EXECUTION ```` Additional non-collapse laws: ```text SOURCE_ORDER ≠ GENERATION_ORDER GENERATION_ORDER ≠ DISPLAY_ORDER DISPLAY_ORDER ≠ SLOT_ORDER SLOT_ORDER ≠ ACTIVE_TRAVERSAL_ORDER OPERATOR_ORDINAL ≠ HOUSE_ORDINAL by default TOKEN_CARRIER ≠ NUMBER_POSITION NUMERAL_SIGN ≠ NUMBER_VALUE GLYPH ≠ OPERATOR LETTER ≠ OPERATOR unless explicitly admitted ``` This is not merely schema hygiene. It is principial. Any machine extraction that collapses these layers corrupts the ROTA. ============================================================ V. ORDER PLURALISM LAW ====================== Every ROTA machine may contain multiple legitimate orders. At minimum, the extraction substrate must be able to represent: ``` source_order generation_order display_order slot_order active_traversal_order ``` These are not synonyms. --- ## V.1 SOURCE_ORDER The order in which source text lists elements. Example: ``` Up, Down, East, West, South, North ``` --- ## V.2 GENERATION_ORDER The order in which the machine comes into being. Example from ROTA SEPHIROT ARBOR: ``` CORE PRE → BINARY I → TETRA II → HEXA III → OCTO IV → DECA V ``` ROTA SEPHIROT ARBOR v0.2.0 explicitly separates generation ordinality from geometric display order. --- ## V.3 DISPLAY_ORDER The order in which the machine is visually arranged. Example from ROTA SEPHIROT ARBOR: ``` CORE → DECA → OCTO → HEXA → TETRA → BINARY ``` This is deliberately not identical to generation order. --- ## V.4 SLOT_ORDER The final stabilized positional order. Example: ``` 1Ω,2Ω,3Ω,4Ω,5Ω,6Ω,7Ω,8Ω,9Ω,10Ω ``` --- ## V.5 ACTIVE_TRAVERSAL_ORDER The order used during admitted operation. This may differ from all previous orders. Law: ``` no order may be substituted for another unless the source or patch explicitly declares equivalence. ``` ============================================================ VI. SOURCE TRACE LAW ==================== Machine extraction must be traceable. Every extracted object should preserve: ``` artifact_path artifact_class source section extracted claim extraction status confidence unresolved markers where applicable ``` The source-trace law follows the broader parsing discipline requiring source-before-memory, parse-before-claim, and artifact-before-inference. The local control plane requires disciplined parsing and prevents unrestricted generation outside stack law. Required extraction statuses: ``` DIRECT_TEXT STRUCTURAL_INFERENCE_FROM_TEXT USER_SUPPLIED_PATCH DERIVED_SCHEMA_REQUIREMENT UNRESOLVED ``` Forbidden: ``` silent inference source-free placement inferred connection without trace unmarked visual convention ``` ============================================================ VII. MACHINE STATE LAW ====================== A machine representation must distinguish at least three state layers: ``` visual_state admission_state execution_state ``` --- ## VII.1 VISUAL_STATE Visual states include: ``` UNSELECTED SELECTED HOVERED FOCUSED DISPLAYED ``` Visual state may change without AREPO admission. --- ## VII.2 ADMISSION_STATE Admission states include: ``` UNTESTED AREPO_ADMITTED AREPO_REJECTED DEFERRED ``` Admission is not execution. --- ## VII.3 EXECUTION_STATE Execution states include: ``` NOT_EXECUTED READY EXECUTING EXECUTED FAILED ``` Execution requires AREPO admission. Law: ``` visual interaction is not operation. admission is not operation. operation requires OPERA. ``` ============================================================ VIII. CARRIER PACKAGE LAW ========================= Every operator should declare a CARRIER_PACKAGE or explicitly mark it unresolved. A carrier package distinguishes: ``` operator letter glyph numeral sign token codepoint value display form ``` Minimum fields: ``` carrier_type carrier_token carrier_script carrier_display carrier_status ``` Allowed carrier types: ``` LATIN_LETTER HEBREW_LETTER PHOENICIAN_LETTER NUMERAL_SIGN GLYPH TOKEN COMPOSITE ABSTRACT_ID ``` TENET LITTERAE ARS already stabilizes this distinction by separating Latin Ars operators, Hebrew letter carriers, Hebrew numeral notation, Phoenician carriers, Unicode references, numeric values, and operator position. Therefore: ``` carrier package is not optional decoration. ``` It is the anti-collapse layer that prevents: ``` token = operator letter = value glyph = meaning numeral sign = number-position ``` ============================================================ IX. SLOT / CONTENT LAW ====================== A machine slot may be valid while empty. A machine slot may be restrained from filling. A machine slot may be displayable without content. This follows the general Sephirotic correction: ``` SEPHIRAH = relative ordinal slot inside SEPHIROT_10 ``` and: ``` SEPHIRAH_BELIMAH = valid relative slot under non-filling constraint ``` where empty slot is not nonexistent slot and restrained slot is not invalid slot. Generalized machine law: ```text EMPTY_SLOT ≠ NONEXISTENT_SLOT RESTRAINED_SLOT ≠ INVALID_SLOT UNFILLED_POSITION ≠ NON_STRUCTURE ``` This is decisive for machine extraction because a parser must preserve declared but unfilled houses. ============================================================ X. LOCUS / CAMERA / CHAMBER LAW =============================== The machine schema must support structural units beyond simple wheel and house. --- ## X.1 LOCUS LOCUS is: ``` a coordinate-like structural position, especially in TABULA-like machines. ``` It may coordinate: ``` • multiple operators • multiple houses • multi-axis references • combination slots ``` LOCUS ≠ CASA by default. --- ## X.2 CAMERA CAMERA is: ``` a relational observation field. ``` It exposes what becomes visible between selected structures. ROTA TRADITIO defines camera as relational observation field between contracted dignities; it exposes tension, concordance, mediation, asymmetry, teleology, dependency, contradiction, stabilization, residue, and symbolic drift, but does not define operators. Therefore: ``` CAMERA ≠ OPERATOR CAMERA ≠ OPERA CAMERA ≠ CONNECTION by default ``` --- ## X.3 CHAMBER CHAMBER is: ``` a structured combination field. ``` It may contain: ``` • loci • cameras • houses • wheel combinations • multi-operator fields • traversal routes ``` CHAMBER is necessary for: ``` • Figura Quarta • triadic correlatives • Q/A/T/S combination machines • multiplicatio structures ``` ============================================================ XI. MULTIPLICATIO LAW ===================== A ROTA machine may involve multiple wheels in interactive series. Such machines must not be flattened into a single wheel. Multiplicatio requires: ``` wheel_series multiplication_role rotation_policy combination_output ``` Allowed wheel roles: ``` W1 W2 W3 W4 CUSTOM ``` Allowed rotation policies: ``` FIXED ROTATABLE LOCKED_TO_PARENT DYNAMIC ``` Possible outputs: ``` LOCUS CHAMBER CAMERA QUESTION CUSTOM ``` Principle: ``` multi-wheel interaction is machine structure, not decorative geometry. ``` ============================================================ XII. EXTRACTION IS NOT CANONIZATION =================================== A machine schema instance may be: ``` parsed derived provisional user-patched unresolved invalid ``` But extraction itself does not canonize. A parsed structure may be faithful to a draft artifact and still not be canonical. Therefore machine instances require canonicality_status: ``` PARSED_FROM_ARTIFACT DERIVED_FROM_ARTIFACT USER_PATCH NUOVA_DRAFT PROVISIONAL CANONICAL_CANDIDATE UNRESOLVED INVALID ``` Law: ``` machine-readable ≠ canonical executable ≠ true visualized ≠ admitted admitted ≠ executed ``` ============================================================ XIII. EXTRACTION DIRECTION LAW ============================== The lawful extraction direction is: ```text TEXTUAL_ARTIFACT → SOURCE_TRACE → STRUCTURAL_PARSE → MACHINE_STATE → VALIDATION → OPTIONAL_VISUAL_BINDING → AREPO_ADMISSION → OPERA_EXECUTION → SATOR_MEDIATION ``` Forbidden direction: ```text VISUAL_BINDING → defines source MACHINE_STATE → defines doctrine OPERA_EXECUTION → retroactively validates source TRADITION → defines operator ``` Traditio discipline remains active: tradition may be dataset, comparatio object, historical residue, mnemonic trace, or computational model candidate, but not authority over operators. ============================================================ XIV. MINIMUM VALID MACHINE INSTANCE =================================== A minimum valid MACHINA EX ROTA instance must include: ``` schema_meta source_trace terminology_law rota wheels houses operators placements connections traversal_model extraction_model validation_model ``` Recommended: ``` order_model state_model carrier_packages locus_model chamber_model camera_model multiplicatio_model visual_binding unresolved_items ``` If these are absent, the instance may still be exploratory, but not stable. ============================================================ XV. FAILURE PRINCIPLES ====================== The following failures are principially blocking: ``` ROTA_WHEEL_COLLAPSE HOUSE_OPERATOR_ORDINAL_COLLAPSE MISSING_WHEEL_PRE WHEEL_PRE_MARKED_OPERATIVE MISSING_SOURCE_TRACE ROTA_NOT_PARSED TRAVERSAL_WITHOUT_CONNECTION OPERATOR_PLACED_WITHOUT_HOUSE HOUSE_REFERENCES_UNKNOWN_WHEEL CONNECTION_REFERENCES_UNKNOWN_HOUSE VISUAL_STATE_TREATED_AS_EXECUTION ORDER_COLLAPSE MISSING_CARRIER_PACKAGE LOCUS_WITHOUT_COORDINATES CAMERA_OPERATOR_COLLAPSE CHAMBER_WITHOUT_MEMBERS MULTIPLICATIO_WITHOUT_WHEEL_SERIES AREPO_EXECUTION_BYPASS OPERA_EXECUTION_WITHOUT_ADMISSION ``` ============================================================ XVI. RELATION TO COMPUTATIONAL KABBALAH STACK ============================================= Within the Kabbalah Stack, this TENET supports the larger computational orientation: ``` NETIVOT = traversable route / path-unit field SEPHIROT = relative ordinal count-slots OTIOT = token-carriers BELIMAH = restraint / non-filling control ROTA = traversable machine surface PLACEMENT = explicit binding of content to slot ``` This computational orientation has already been registered in the control-plane manifest, where the stack is framed as a controlled computational model extracted from Hebrew linguistic, paleographic, arithmetic, and Sefer Yetzirah source-structural material. MACHINA EX ROTA is the software-facing extraction layer for that orientation. It does not replace the stack. It makes the stack representable. ============================================================ XVII. DEFERRED TO AREPO MACHINA EX ROTA ======================================= This TENET does not yet decide: ``` • which extracted machine instances are admissible • which unresolved fields block use • which inferred placements are acceptable • which visual bindings are safe • which source traces are sufficient • which machine states are ready for OPERA ``` These belong to: ``` AREPO MACHINA EX ROTA ``` ============================================================ XVIII. COMPRESSED LAW ===================== TENET MACHINA EX ROTA: ``` A ROTA may become machine-readable only by preserving its internal structural distinctions. Machine extraction encodes structure. It does not execute, canonize, validate, or ontologize it. ``` Formula: ```text ROTA_TEXT → MACHINE_STATE only if: ROTA / WHEEL / CASA / OPERATOR / PLACEMENT / CONNECTION / TRAVERSAL / VISUAL_BINDING / ADMISSION / EXECUTION remain distinct. ``` ============================================================ END — TENET MACHINA EX ROTA v0.1.0 ================================== ``` ```