Update README.md
Browse files
README.md
CHANGED
|
@@ -1,3 +1,14 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
# Deterministic Governance Mechanism
|
| 2 |
|
| 3 |
Probabilistic systems cannot be audited. If a decision changes between runs with identical inputs, the reasoning chain is non-reproducible, and post-hoc explanation is speculation.
|
|
@@ -8,7 +19,7 @@ This is a reference implementation of deterministic exclusion: a governance laye
|
|
| 8 |
|
| 9 |
## Core Invariant
|
| 10 |
|
| 11 |
-
```
|
| 12 |
Same input + same configuration + same substrate → same output (bit-identical)
|
| 13 |
```
|
| 14 |
|
|
@@ -24,7 +35,7 @@ python exclusion_demo.py replay
|
|
| 24 |
|
| 25 |
Output: Five identical SHA-256 hashes.
|
| 26 |
|
| 27 |
-
```
|
| 28 |
SHA-256(canonical_input || configuration || substrate_hash || output_decisions)
|
| 29 |
```
|
| 30 |
|
|
@@ -34,13 +45,14 @@ If the hash changes, the computation diverged. If it doesn't, the decision was d
|
|
| 34 |
|
| 35 |
Candidates are stateful objects under constraint pressure. Exclusion occurs when accumulated stress exceeds a fixed yield threshold:
|
| 36 |
|
| 37 |
-
```
|
| 38 |
σ(t) > σ_y → Exclusion
|
| 39 |
```
|
| 40 |
|
| 41 |
No temperature. No sampling. No randomness. Stress accumulates via explicit arithmetic over discrete time steps. Once excluded, a candidate cannot re-enter.
|
| 42 |
|
| 43 |
The system implements:
|
|
|
|
| 44 |
- Deterministic stress accumulation (no entropy sources)
|
| 45 |
- Cryptographic yield strength (BLAKE2b, no salt)
|
| 46 |
- Three-phase pressure schedule (nucleation, quenching, crystallization)
|
|
@@ -58,18 +70,21 @@ python exclusion_demo.py
|
|
| 58 |
```
|
| 59 |
|
| 60 |
**Prove determinism:**
|
|
|
|
| 61 |
```bash
|
| 62 |
python exclusion_demo.py replay
|
| 63 |
# Runs 5 times - prints identical SHA-256 hashes
|
| 64 |
```
|
| 65 |
|
| 66 |
**Compare modes:**
|
|
|
|
| 67 |
```bash
|
| 68 |
python exclusion_demo.py compare
|
| 69 |
# Shows behavioral differences across elastic modulus modes
|
| 70 |
```
|
| 71 |
|
| 72 |
**Run full test suite:**
|
|
|
|
| 73 |
```bash
|
| 74 |
python test_suite.py
|
| 75 |
# 14 mechanical tests verifying invariants
|
|
@@ -78,6 +93,7 @@ python test_suite.py
|
|
| 78 |
## What This Is
|
| 79 |
|
| 80 |
An experiment showing exclusion can be:
|
|
|
|
| 81 |
- **Deterministic** (same inputs → same outputs)
|
| 82 |
- **Replayable** (hash proves invariance)
|
| 83 |
- **Mechanical** (threshold, not probability)
|
|
@@ -94,6 +110,7 @@ An experiment showing exclusion can be:
|
|
| 94 |
The engine enforces determinism mechanically; it does not validate the quality of the substrate it is pointed at. Misuse risk concentrates upstream in substrate selection (what is treated as verified) and configuration selection (how strict exclusion is).
|
| 95 |
|
| 96 |
Mitigations target provenance and auditability:
|
|
|
|
| 97 |
- Substrates should be permissioned and signed
|
| 98 |
- Configuration and substrate hashes recorded with each run
|
| 99 |
- Silent swaps detectable via hash divergence
|
|
@@ -125,12 +142,13 @@ For production-ready deployment with enterprise features → **[verhash.com](htt
|
|
| 125 |
|
| 126 |
Interested in technology licensing, partnerships, or investment:
|
| 127 |
|
| 128 |
-
**Contact:** ryan@verhash.net
|
| 129 |
**Organization:** Verhash LLC
|
| 130 |
|
| 131 |
## Patent Notice
|
| 132 |
|
| 133 |
Demonstrates concepts from pending patent application:
|
|
|
|
| 134 |
- **Title:** "Deterministic Material-Field Governance for Computational Systems"
|
| 135 |
- **Priority Date:** January 25, 2026
|
| 136 |
- **Applicant:** Verhash LLC
|
|
|
|
| 1 |
+
---
|
| 2 |
+
title: Deterministic Governance Mechanism
|
| 3 |
+
emoji: 🛡️
|
| 4 |
+
colorFrom: blue
|
| 5 |
+
colorTo: indigo
|
| 6 |
+
sdk: streamlit
|
| 7 |
+
sdk_version: 1.30.0
|
| 8 |
+
app_file: app.py
|
| 9 |
+
pinned: false
|
| 10 |
+
---
|
| 11 |
+
|
| 12 |
# Deterministic Governance Mechanism
|
| 13 |
|
| 14 |
Probabilistic systems cannot be audited. If a decision changes between runs with identical inputs, the reasoning chain is non-reproducible, and post-hoc explanation is speculation.
|
|
|
|
| 19 |
|
| 20 |
## Core Invariant
|
| 21 |
|
| 22 |
+
```text
|
| 23 |
Same input + same configuration + same substrate → same output (bit-identical)
|
| 24 |
```
|
| 25 |
|
|
|
|
| 35 |
|
| 36 |
Output: Five identical SHA-256 hashes.
|
| 37 |
|
| 38 |
+
```text
|
| 39 |
SHA-256(canonical_input || configuration || substrate_hash || output_decisions)
|
| 40 |
```
|
| 41 |
|
|
|
|
| 45 |
|
| 46 |
Candidates are stateful objects under constraint pressure. Exclusion occurs when accumulated stress exceeds a fixed yield threshold:
|
| 47 |
|
| 48 |
+
```text
|
| 49 |
σ(t) > σ_y → Exclusion
|
| 50 |
```
|
| 51 |
|
| 52 |
No temperature. No sampling. No randomness. Stress accumulates via explicit arithmetic over discrete time steps. Once excluded, a candidate cannot re-enter.
|
| 53 |
|
| 54 |
The system implements:
|
| 55 |
+
|
| 56 |
- Deterministic stress accumulation (no entropy sources)
|
| 57 |
- Cryptographic yield strength (BLAKE2b, no salt)
|
| 58 |
- Three-phase pressure schedule (nucleation, quenching, crystallization)
|
|
|
|
| 70 |
```
|
| 71 |
|
| 72 |
**Prove determinism:**
|
| 73 |
+
|
| 74 |
```bash
|
| 75 |
python exclusion_demo.py replay
|
| 76 |
# Runs 5 times - prints identical SHA-256 hashes
|
| 77 |
```
|
| 78 |
|
| 79 |
**Compare modes:**
|
| 80 |
+
|
| 81 |
```bash
|
| 82 |
python exclusion_demo.py compare
|
| 83 |
# Shows behavioral differences across elastic modulus modes
|
| 84 |
```
|
| 85 |
|
| 86 |
**Run full test suite:**
|
| 87 |
+
|
| 88 |
```bash
|
| 89 |
python test_suite.py
|
| 90 |
# 14 mechanical tests verifying invariants
|
|
|
|
| 93 |
## What This Is
|
| 94 |
|
| 95 |
An experiment showing exclusion can be:
|
| 96 |
+
|
| 97 |
- **Deterministic** (same inputs → same outputs)
|
| 98 |
- **Replayable** (hash proves invariance)
|
| 99 |
- **Mechanical** (threshold, not probability)
|
|
|
|
| 110 |
The engine enforces determinism mechanically; it does not validate the quality of the substrate it is pointed at. Misuse risk concentrates upstream in substrate selection (what is treated as verified) and configuration selection (how strict exclusion is).
|
| 111 |
|
| 112 |
Mitigations target provenance and auditability:
|
| 113 |
+
|
| 114 |
- Substrates should be permissioned and signed
|
| 115 |
- Configuration and substrate hashes recorded with each run
|
| 116 |
- Silent swaps detectable via hash divergence
|
|
|
|
| 142 |
|
| 143 |
Interested in technology licensing, partnerships, or investment:
|
| 144 |
|
| 145 |
+
**Contact:** <ryan@verhash.net>
|
| 146 |
**Organization:** Verhash LLC
|
| 147 |
|
| 148 |
## Patent Notice
|
| 149 |
|
| 150 |
Demonstrates concepts from pending patent application:
|
| 151 |
+
|
| 152 |
- **Title:** "Deterministic Material-Field Governance for Computational Systems"
|
| 153 |
- **Priority Date:** January 25, 2026
|
| 154 |
- **Applicant:** Verhash LLC
|