Trit-Trie Visualizer

What a Trit-Trie Is, and Why the Branching Factor Matters

A trie is a prefix tree: a search structure in which the path from the root to a node is the key, so nothing is stored twice and a lookup costs one step per symbol rather than one comparison per stored key. A trit-trie is that structure over balanced ternary, so every node branches three ways — −1, 0 and +1 — instead of the two ways a binary trie offers.

Three-way branching is not a cosmetic difference. A tree of d levels reaches 2^d leaves in binary and 3^d in ternary, so the same key space is covered in log₃ rather than log₂ steps — about 63 % of the depth. Depth is the thing that costs time in a trie, because each level is a dependent memory reference that cannot begin until the previous one has returned. Removing a third of the levels removes a third of that serial chain.

The visualiser above encodes each letter as exactly three trits. Three trits carry 3³ = 27 distinct paths and the alphabet has 26 letters, so A–Z maps to −13…+12 with one path left spare — a near-perfect fit, and the reason the input is restricted to A–Z rather than accepting arbitrary text. Insert two keys sharing a first letter and the shared prefix is visibly a single path; that shared path is the whole point of a trie.

In the THATTE stack this is hardware, not a data structure written in software: Thatte4 covers ternary memory, interconnect and a trit-trie search engine in which the three-way decision at each node is a property of the device rather than a branch a processor has to execute. TritFS applies the same shape to a filesystem address space, and how it works starts from the device underneath all of it.

Full Technical Brief Available Under NDA

Simulation data, quantum transport results, fabrication specifications, and complete patent claims are shared under mutual NDA only.

Follow maniTLab

New research, patent updates and essays, as a feed your reader collects for you. No list to join, no address to hand over, nothing to unsubscribe from.