Arch removed the package that allowed sandboxes to function while unprivileged user namespaces stayed disabled, and there is no replacement for it. Ditana reverses the arrangement instead: a namespace is refused to everything that has not been explicitly declared, and a BPF program on the kernel’s userns_create hook enforces that. A machine that cannot load the program keeps namespaces entirely switched off, so a failure costs sandboxes and never protection.

The first stable release of the reasoning engine. zelph can be tried in the browser as WebAssembly with nothing leaving the machine, installed from prebuilt binaries on Linux, macOS and Windows, or embedded in a host application through its C ABI, for which a Rust layer is provided.

The whole mathematical stack is written in zelph rules instead of C++, spanning from digit tables to symbolic differentiation, and each example in the documentation was executed against the actual binary.

Since August 2026, zelph has been supported by NLnet’s NGI0 Commons Fund for Auditable Reasoning over Linked Open Data, with financial support from the European Commission’s Next Generation Internet programme and from the Swiss State Secretariat for Education, Research and Innovation.

When a reasoner draws a conclusion in an open knowledge graph, the result typically emerges and the proof remains within the tool. The project turns zelph’s ability to reason over Wikidata into infrastructure usable by any open knowledge graph: streaming import for RDF/N-Triples and JSON-LD, an open export format that publishes full derivation chains as Linked Data, a reusable library of constraint rules, and a proof explorer that lets anyone trace a derived fact back to its evidence.

In July 2026, Alpöge and Fable exhibited a polynomial map that refutes a conjecture open since 1939. zelph verifies that counterexample over the integers using rules alone. The engine’s C++ core contains no arithmetic at all, so digits, positional arithmetic, signed integers, symbolic differentiation and polynomial normal forms are built up as rules first, and the refutation runs on top of them.

The tutorial: https://acrion.github.io/zelph/math/tutorial-jacobian/

The largest release in Ditana’s history. Everything the installer knows now lives in a separate repository as data rather than in code, four desktop environments can be installed side by side, and an improvement reaches new installations without a new medium.

Release notes: https://ditana.org/release-notes/0-9-3-beta/

Stefan gave a talk for the Wikidata Ontology Cleaning Task Force about zelph.org and its potential applications for analyzing and cleaning the Wikidata ontology.

See https://nexuslua.org