Products
Software and applied systems you can use, built on coherence energy and engineered so every decision can be re-run and checked. Some are live today, some are open source, some are coming soon.
Use it now
Live products
LumOne
A coherence-native AI whose every decision is re-executable and cryptographically receipted. It reasons in a way you can audit, abstains instead of bluffing when it is unsure, and folds each answer into a proof a stranger can re-run. Live in your browser.
What it shows: an intelligence you can audit, reproduce, and govern.
One Link
Private peer-to-peer messaging, files, and calls with no accounts and no servers. End-to-end encrypted, onion-routed, with post-quantum identity, built on the coherence stack and running in production.
What it shows: the coherence mesh as real production infrastructure.
Open and coming
Open, live, and launching soon
Ariadne
A Python-native toolkit for cislunar mission design and trans-Neptunian-object discovery. Standard astrodynamics, with every claim checked against an independent tool: it agrees with NASA GMAT to within 150 meters over a three-day transfer.
What it shows: validated engineering software, verified against an independent reference.
omega_one
A coherence-native machine-learning engine: strong tabular accuracy, and the only machine-learning decision a third party can re-run and verify bit-for-bit, wrapped in a signed receipt that catches any tampering.
What it shows: a reproducible, signable machine-learning decision. Re-run one yourself in Prove It Three Ways.
Obsign
Provable computation. Write a kernel once, run it on CPU or GPU, and ship a cryptographic receipt anyone can re-run to confirm the result: bit-for-bit for exact-integer kernels, to the single-precision floor for floating-point. Provenance you re-run, not a watermark you trust. Preview at obsign.io.
What it shows: determinism and provenance turned into a product. See the live receipt teaser.
Applied systems
In development, held to measured results
A.C.E.
An autonomous, governed cognitive architecture built entirely in Coherence Language, running on a coherence-energy metabolism. In active development, pre-demo: its page says exactly what is and is not real yet.
What it tests: a governed mind built end-to-end in Coherence Language.
Glasshouse
A provable-runtime security machine: every consequential action proves its legitimacy before it takes effect, and the whole timeline is signed and independently re-runnable. Its hardware root is proven on a real TPM.
What it shows: a breach is undeniable, attributable, and recoverable. Put its signed ledger on trial in The Gauntlet.
One Mind
A deterministic decision core for autonomous systems: coordinated under full jamming, with forbidden actions unrepresentable by construction, and every decision proven and replayable bit-for-bit on any chip.
What it tests: auditable autonomy that proves each decision. Command the swarm yourself - break their consensus with sloppy math, spoof them, shoot them down, then re-verify the signed mission certificate.
HazardPulse
Hazard-forecasting models with measured skill. The earthquake forecaster is walk-forward scored against a named baseline, null-tested and honestly reported (retrospective, not yet operational). A forecasting algorithm, honestly scored, not a claim about new physics.
What it tests: calibrated forecasting on noisy real-world signals, scored against a named baseline.
Coherence Proof Fabric
The trust kernel under the stack, built from the field arithmetic up: number-theoretic transform, hash, low-degree test, and succinct prover, with no external prover as a load-bearing dependency. It turns any computation into a hash-committed, hybrid-signed proof a stranger can re-verify, classical and post-quantum signatures together, with a transparency log.
It also composes: a proof can verify another proof inside a circuit, so many proofs aggregate into one. Alongside it sits a confidential-computing suite written in the same language, covering fully homomorphic encryption, secure multi-party computation, and verifiable delay functions.
What it shows: any computation, turned into a proof. Verify its zero-knowledge STARK yourself in The Gauntlet.
Next