Build & verify
Rust implements the emulator, cross-compilers and independent reference checks. Host files and development tools support the experiment.
Development substrateA ternary chip needs more than a new way to calculate. We’re building the software that makes it a computing platform.
Executable foundations already connect native arithmetic, a Rust cross-toolchain, protected boot, bounded system services and small AI applications. The next step is a broader, integrated native stack.
One trit. Three possible values.
current operations
represented in encoded execution
ISA remains open
evidence and review gates ahead
host tools, native programs
an explicit development boundary
We develop on ordinary computers. Inside the modeled target, values, addresses, instructions, layouts and device interfaces have native ternary definitions.
Rust implements the emulator, cross-compilers and independent reference checks. Host files and development tools support the experiment.
Development substrateTrinaryASM instructions run the defined application and system routines. Device services use declared native protocols, with explicit bounds and failures.
Native software targetRTL and logical device models inform future hardware. Physical timing, energy, reliability and manufacturing evidence require their own validation.
Research & future qualificationA host implementation is evidence for its declared model. It does not automatically establish a guest service or a physical hardware advantage.
We have executable slices through most foundational layers. Each status describes the stated scope; it is not a claim that the entire layer is finished.
All 18 current operations are represented in the assembler, packet encodings and emulator. Balanced-trit arithmetic, three-way branches, bounded indexed memory and raw trit transfers have explicit semantics.
A Rust cross-toolchain lowers typed TIR, structured loops and bounded functions into TrinaryASM. It includes register allocation, exact wide spills, assembly preprocessing, relocatable objects, named sections, static linking and archives.
The compiler runs on the host today. Generating native code does not make the compiler itself a native guest application.
Protected guest boot validates and loads bounded images. Executed system routines provide traps, two fixed cooperative isolated tasks, messages and bounded task-owned allocation with cleanup.
Cooperative tasks are implemented in a bounded profile. Timer-driven preemption and a general operating system remain open.
Guest routines use native record and device protocols. A bounded flat persistent file namespace supports ownership, handles, atomic replacement and recovery within its defined profile.
Guest text routines pack, unpack and scan Unicode scalars, convert strict UTF-8 at an explicit interchange boundary and tokenize against an ordered scalar vocabulary.
Dense, packed, tiled and spatial inference paths execute through the native toolchain, including handwritten-digit classifiers. A small statistical language-model request also connects guest token selection and output conversion.
These are bounded research workloads. They do not establish a transformer stack, a general LLM product or measured chip acceleration.
Native GF(3) protection, checked execution and guarded publication are exercised with scoped fault injection. Persistence research models also explore checkpoints, journals, anchors and restart behavior.
Rust architectural models, clocked RTL comparisons and bounded logical lowering make candidate implementations inspectable. They help define the contract that future devices must satisfy.
Simulation correctness and logical timing estimates do not establish physical speed, power, area or efficiency.
The destination is a complete native computing platform. These are acceptance gates, not a release calendar. These gates summarize readiness across layers; implementation follows a separate dependency sequence. A component test does not close an entire gate.
Define reset, boot, native values and addresses, arithmetic faults, memory protection and device behavior.
Pass when encoded valid and invalid cases agree with independent references and the versioned scope is reviewed.
Compile meaningful native programs with functions, frames, input-dependent control, executable loading and memory services.
Pass when source-to-execution and explicit failure tests cover the supported language and runtime beyond neural kernels.
Expand protected boot and bounded tasks into kernel ownership of memory, traps, interrupts, scheduling and devices.
Pass when guest code manages the declared lifecycle, isolation and recovery behavior without hidden host scheduling.
Grow native records and persistent files into broader storage and external I/O with explicit publication boundaries.
Pass when bounded operations, errors, retries and restarts preserve the declared durable-state and external-effect contracts.
Broaden native numeric, text, collection and I/O libraries, add runtime debugging and move development tools into the guest.
Pass when the guest builds and loads applications, then reproducibly rebuilds its own toolchain.
Run complete non-neural and AI applications through shared services, including persistent state and external output.
Pass when end-to-end success, faults and restarts are demonstrated across the composed native stack.
Carry versioned software-visible interfaces, native images and conformance traces to the eventual physical implementation.
Pass when the backend satisfies those contracts and separately reported physical measurements support any hardware claims.
Our engineering coverage map tracks every guest-visible feature to instructions, a guest routine or a declared native device contract. A missing path is recorded as a gap.
Native representation, exact widths, bounds, ownership, overflow and observable effects.
The instruction sequence, guest routine or hardware/device contract that provides the capability.
Success cases and explicit faults, with independent checks, declared limits and remaining gaps.
Opcode coverage, platform capability and a complete guest software stack are different milestones. The current 18 operations do not prove all three. We prefer proved sequences of existing operations; new instructions need their own semantic and experimental justification.
This is a public summary of our Native Stack roadmap and TrinaryASM coverage records as of October 30, 2026. Status is scoped to the implementations and regression evidence described above; the full engineering repository is not reproduced here.
The next work is breadth and composition: more capable system services, a native development environment, larger applications and a measured hardware transition.
We’re building toward native ternary software readiness alongside our hardware research.