File size: 10,803 Bytes
27ba41e
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
# 001 β€” STACK OVERVIEW
## Primordial Compute Stack v0.1
**Created and Developed by Collin D. Weber**

---

## The Central Claim

> *Autonomy is allowed only when HIR resonance remains stable under pressure.*
> β€” README_OSF.md, Primordial OS HIR Runtime Prototype v0.1

The Primordial Compute Stack is a layered architecture for **bounded autonomy governance** β€” a
system in which every computational action must pass through Honesty, Integrity, and Respect
evaluation before it is permitted. The stack defines not just processing logic, but the memory,
governance, and security layers that make bounded autonomy physically and computationally enforceable.

This overview describes the layers as they currently exist. It does not collapse the distinction
between what is running code, what is a hardware specification, and what is a forward-looking
architectural proposal. Those distinctions are explicit in each layer entry below.

---

## Layer Map

```
β”Œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”
β”‚  LAYER IV β€” Resonant Access Memory (RAM)                        [PROVISIONAL]β”‚
β”‚  Primordial_RAM_Architecture_v0.1_Collin_D_Weber                            β”‚
β”‚  HIR-gated provenance-bound memory Β· 5-layer stack Β· Write Gate equation    β”‚
β”‚  Status: architectural specification. Not yet prototyped.                   β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚  LAYER III β€” GPU Parallel Compute Mapping                       [ARCH-MAP]  β”‚
β”‚  Primordial_HIR_SPU_GPU_Map.html                                            β”‚
β”‚  SIMT gate parallelism Β· warp-level H/I/R Β· Tensor core batch               β”‚
β”‚  Status: architectural translation of Layer II onto GPU compute model.      β”‚
β”‚  Not an implementation. No CUDA code produced.                              β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚  LAYER II β€” HIR Security Processing Unit (HIR-SPU / CPU)   [HARDWARE-SPEC] β”‚
β”‚  Primordial_HIR_SPU_Architecture_v0.1_Collin_D_Weber.zip                   β”‚
β”‚  Deterministic governance coprocessor Β· FPGA prototype spec                 β”‚
β”‚  SystemVerilog RTL Β· 30-register file Β· 14-instruction set                 β”‚
β”‚  Status: hardware architecture specification. Not fabricated.               β”‚
β”‚  FPGA implementation path defined; not yet executed.                        β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚  LAYER I-B β€” CyberSec Suite                                     [RUNNABLE]  β”‚
β”‚  Primordial_CyberSec_Suite_v0.1_Collin_D_Weber.zip                         β”‚
β”‚  Process/network/file-integrity collectors Β· HIR bridge                    β”‚
β”‚  Triage rules Β· Windows/Linux/macOS evidence collection                    β”‚
β”‚  Status: runnable Python prototype. Evidence bridge to HIR kernel.          β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚  LAYER I-A β€” OS HIR Runtime Prototype                           [RUNNABLE]  β”‚
β”‚  Primordial_OS_HIR_Runtime_Prototype_v0.1_Collin_D_Weber.zip               β”‚
β”‚  HIR Kernel Β· Diamond gates Β· Equation datapath Β· Audit log                β”‚
β”‚  24/24 tests passing Β· GREEN/YELLOW/RED routing verified                   β”‚
β”‚  Status: runnable Python prototype. Primary canonical artifact.             β”‚
β””β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”˜
       ↑
  Foundation
```

---

## Layer Descriptions

### Layer I-A β€” OS HIR Runtime Prototype `[RUNNABLE]` `[CANONICAL]`

The primary artifact. A runnable Python governance-kernel implementing the HIR equation stack
as defined in the Primordial Calculus framework.

**What it contains:**
- `hir/kernel.py` β€” the central operating loop (Β§12 of the instruction set)
- `hir/equations.py` β€” the full equation datapath: B, P, S, U, Ξ, C, Θ, Ξ”D, D, Fidelity, Cohesion, Resonance
- `gates/diamond.py` β€” H, I, R gate evaluation (scores [0,1], hard-zero failure paths)
- `gates/action.py` β€” action packet schema
- `audit/log.py` β€” append-only SHA-256 hash-chained audit log
- `hir/failure_modes.py` β€” Β§18 failure mode detection (8 modes)
- Test suite: 24/24 passing, GREEN/YELLOW/RED routing confirmed

**What it is not:** a bootable OS, production infrastructure, or security-certified runtime.

**Canonical source:** OSF release package, SHA-256 `85b9fdf9...` (inner runtime zip)

---

### Layer I-B β€” CyberSec Suite `[RUNNABLE]`

A runnable cybersecurity evidence collection and HIR governance bridge.

**What it contains:**
- Host evidence collectors: process, network, file integrity, audit
- `hir_bridge.py` β€” translates security findings into HIR action packets
- `triage_rules.json` β€” rule class / severity mappings
- Windows (PowerShell), Linux, macOS collection scripts

**What it is not:** a production EDR, SIEM replacement, or certified security tool.

**Relationship to Layer I-A:** The CyberSec Suite produces normalized evidence packets that
are consumed by the HIR Kernel. It is the host-side evidence layer; the HIR Kernel provides
the governance layer. They are coupled through `hir_bridge.py`.

---

### Layer II β€” HIR-SPU Architecture `[HARDWARE-SPEC]`

A hardware architecture specification for a deterministic governance coprocessor.

**What it contains:**
- `ARCHITECTURE_HIR_SPU_v0.1.md` β€” complete architecture document
- `specs/REGISTER_MAP.md` β€” 30-register memory-mapped interface (0x00–0x74)
- `specs/INSTRUCTION_SET.md` β€” 14-instruction command set
- `specs/FUNCTIONAL_SPEC.md`, `SAFETY_INVARIANTS.md`, `FIXED_POINT_PROFILE.md`
- `rtl/hir_spu_top.sv` β€” SystemVerilog RTL scaffold (Q16.16 fixed-point arithmetic)
- `rtl/hir_spu_pkg.sv` β€” package definitions
- `sim/test_vectors.json` β€” simulation test vectors
- `specs/PACKET_SCHEMAS.json`, `RULE_CLASS_MAP.json`

**What it is not:** fabricated silicon. The RTL is a scaffold β€” architecture-verified, not
manufacturing-verified. The FPGA implementation path is defined; not yet executed.

**Relationship to Layer I-A:** The HIR-SPU hardware specification is derived from the OS Runtime's
Python kernel. The `always_comb` block in `hir_spu_top.sv` is a direct hardware translation of the
`evaluate_diamond()` and equation functions in `equations.py`. The register file maps 1:1 to the
kernel's input/output contract.

---

### Layer III β€” GPU Parallel Compute Mapping `[ARCH-MAP]`

An architectural translation of the HIR-SPU compute graph onto GPU/SIMT execution model.

**What it contains:**
- `Primordial_HIR_SPU_GPU_Map.html` β€” interactive architecture diagram

**Key architectural finding:** H, I, and R gates are fully independent (zero cross-dependency
proven in the RTL `always_comb` block). The Pressure field P has zero dependency on gate results.
This creates a natural 4-warp parallel front-end. The Resonance emergence chain (F β†’ Cβ‚‘β‚˜ β†’ Rn)
maps to 3 sequential SFU (Special Function Unit) sqrt operations.

**What it is not:** a CUDA implementation, a PTX program, or executable GPU code.
This is an architectural mapping only. No GPU code has been written.

---

### Layer IV β€” Resonant Access Memory (RAM) `[PROVISIONAL]`

A forward-looking architectural specification for a HIR-gated, provenance-bound memory system.

**What it contains:**
- `Primordial_RAM_Architecture_v0_1.html` β€” interactive architecture diagram
- `Primordial_RAM_Architecture_v0_1_Collin_D_Weber.docx` β€” OSF-format specification document

**Core architectural proposal:**
- 5-layer memory stack: Working, Episodic, Semantic, Procedural, Integrity/Provenance
- Write Gate: W_i = Q_i Γ— P_i Γ— H_i Γ— I_i Γ— R_i (multiplicative, hard-zero on any axis failure)
- Memory Strength: M_{i,t+1} = M_{i,t} + Ξ±(U_i Γ— Rel_i Γ— Rn_i) βˆ’ Ξ²(D_i + X_i)
- Recall Score: Recall_i(q) = Sim(q,i) Γ— M_i Γ— Rec_i Γ— Trust_i
- 7-stage lifecycle: Capture β†’ Normalize β†’ HIR Gate β†’ Weighting β†’ Consolidation β†’ Recall β†’ Repair/Quarantine
- 8 safety invariants (MEM-INV-1 through MEM-INV-8)

**What it is not:** a running implementation. No Python prototype exists for this layer.
The equations are proposed; they have not been computationally verified against a running system.
The schema is defined; no datastore implements it.

**Status: provisional.** This layer is the forward-looking next step, not a completed artifact.

---

## Canonical Upstream Documents

Inside `docs_canonical/`:

| Document | Status | Description |
|----------|--------|-------------|
| `README_OSF.md` | `[CANONICAL]` | Primary OSF release statement for the runtime prototype |
| `HIR_Architecture_Specification_v1.0_Collin_D_Weber.md` | `[CANONICAL]` | HIR framework applied as engineering specification |
| `Primordial_OS_Baseline_Instruction_Set_v1.0_Collin_D_Weber.md` | `[CANONICAL]` | Baseline instruction set; HIR/OAM boundary definition |

These documents are **upstream canonical source**. They define the framework from which all
hardware specifications and forward-looking layers are derived. Nothing in this bundle supersedes
or modifies them.

---

## What The Stack Does Not Yet Have

For completeness, the following are identified in this overview as absent from v0.1:

- **Fabricated hardware.** The HIR-SPU RTL has not been synthesized to an FPGA or ASIC.
- **GPU code.** The GPU mapping is architectural; no CUDA/PTX implementation exists.
- **RAM prototype.** The memory architecture is specified; no running implementation exists.
- **Formal verification.** No formal proofs of the safety invariants have been produced.
- **Cross-layer integration test.** No test exercises all four layers end-to-end.
- **Signed configuration loading.** Defined in v1.0 roadmaps; not yet implemented.