Technical Disclosure: Compiler-Verified Pure-Gate Event Programs, Their Generated Hardware Boundary, and Partitioned Bare-Metal Execution
A defensive publication that makes the mechanisms of the SISO programming model and its compiler, sisoc 18.1.6, publicly available as prior art, described in enough detail to reproduce them. SISO has three primitives: events, pure gates and a stream. Persistent state exists only as named refs, which are supplied to a gate when it declares them and changed only by mutations it returns. There is no scheduler. The disclosure describes eighteen mechanisms, each with its algorithm, pseudocode and variations: compile-time rejection of order-dependent programs, with "unordered" defined by sibling co-occurrence; sequential propagations on a native kernel, using a roots ring and a propagation ring; static depth and width bounds that size every runtime buffer before the program runs; array indexes proven in range, with inferred bound-field invariants enforced on every write; transient values confined to one propagation, and per-call working memory kept out of persistent state; hardware registers as declared refs; observation as a removable hook; a generated contract and checker between a pure program and its hardware boundary; partitioning one unchanged program across processor cores; per-gate tests run in isolation on three backends. The reference embodiment is a bare-metal HTTP and TLS 1.3 server on x86 with ACME certificate issuance, built from 121 gates.
Authors
- Jonathan Bailey
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-01
- DOI
- https://doi.org/10.5281/zenodo.23856461
- Primary Topic
- Logic, programming, and type systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00