One compiler. Constraint satisfaction, chemistry, circuit equivalence, and symbolic math all solved through orthogonal projection on a Clifford-algebra substrate. Zero learned parameters. Zero training. Reproducible by anyone with an API key.
Closed-world constraint satisfaction (Sudoku, k-coloring, exact cover, scheduling, propositional SAT) solved by orthogonal projection on a Cl(6) eigenstate basis — not WalkSAT, not annealing, not search.
SMILES → Cl(3,0) multivector via G0(Z_total) + G1(positions) + G2(bonds as wedges) + G3(stereo). Rotation-invariant 4D fingerprint crosses conformer & framework boundaries.
Observable-perturbation discipline on ISCAS'85 — gate-level perturbations pre-screened for downstream observability via brute-force random sampling, then verified via substrate equivalence.
Cl(6)/Cl(8) algebra, S^63 manifold, Banach contraction with certainty gates, Thoth margin (63/64), Hawking residual hierarchy. The math behind dydact's cognition.
Frontier-lab discipline: every known failure is listed publicly. If it's not on our list, it works. If it doesn't work and isn't on the list, we want to know.
Every result returned by the lab.dydact.io API includes a BibTeX snippet and a permanent reproducibility hash.
@misc{dolas2026,
author = {Ukpeh, Francis and {DOLAS}},
title = {Universal-Substrate Reasoning via Cl(6) Topological Relaxation},
year = {2026},
url = {https://orthogonalabs.dydact.io}
}