Moscow State University, 1958: the only computer ever series-produced on balanced ternary — digits −, 0, + instead of the bit. Negation is free (flip every trit), no sign bit is needed, and base 3 is measurably cheaper to store than base 2. This panel is runnable: convert, negate, add with balanced carry, and read the radix-economy argument live. It is the ternary hinge from SONIA into World III · THE HALLWAY.
source N. P. Brusentsov & S. L. Sobolev, Setun, Moscow State University, 1958 — the small-series ternary machine built 1959, roughly fifty units. Room: THE MACHINE. Rendered, not quoted.
Designed by Nikolai Brusentsov at Moscow State University under the mathematician Sergei Sobolev. First working machine 1959; about 50 units were built and shipped across the USSR — the only series-produced balanced-ternary computer in history.
It was reliable, cheap, and used fewer components than binary peers. Production was halted for non-technical reasons — an administrative decision, not an engineering failure. Its successor, Setun-70 (1970), extended the idea and never reached series production either.
A bit holds two states: 0, 1. A trit holds three: − (−1), 0, + (+1). In balanced ternary the digit set is symmetric about zero, so a place value 3k can be subtracted as well as added.
One trit carries log₂3 ≈ 1.585 bits of information. Three symmetric symbols is exactly what makes negation a relabelling and drops the sign bit — the two facts the engine proves to the right.
To store N in base b you pay roughly cost = b × (digits) ≈ (b / ln b) · ln N. The factor b / ln b is minimised at b = e = 2.718 — and 3 sits closer to e than 2 does:
3 / ln 3 = 2.7307 < 2 / ln 2 = 2.8854 (optimum e = 2.7183).
| N | base 2 cost | base 3 cost | winner |
|---|
Feed two whole numbers. The engine converts each to a balanced-ternary string of − 0 + by the balanced-remainder rule, negates by flipping trits, and adds them with a balanced carry (carry ±1 whenever a column sum leaves the range −1…+1).
Range −3000…3000 keeps the trit table readable; the algorithm has no such limit.
x in balanced ternary — each trit times its place value 3k:
| trit | place 3k | value |
|---|
Negation (free — flip every trit): —
Addition (balanced carry): —
L3 — Lukasiewicz three-valued logic on {−,0,+}: NOT = −x, AND = min, OR = max.
NOT a = — · a AND b = — · a OR b = —
| x + y (ternary) | engine | decimal | ok |
|---|
The wall is real: three-level hardware is harder to fabricate and standardise than two-level. Setun proved the arithmetic works; the market proved the switches win.
"Computers must be binary." Cut. Setun ran for years on balanced ternary. Binary is a hardware choice, not a requirement of computation.
"You need a sign bit for negatives." Cut. Balanced ternary represents negatives natively; −5 is just −++, the trit-flip of +5 = +−−.
"Base 2 is the most efficient radix." Cut — asymptotically. On radix economy the optimum is e; 3/ln3 = 2.731 beats 2/ln2 = 2.885, so base 3 wins for large N. (Base 2 can still win at small N on the integer digit count — an honest crossover.)
The red move: swap the balanced-ternary carry for a binary carry (carry when a digit exceeds 1, base 2) inside the adder. The trit strings still form, but the sums stop matching decimal.
Break the base-3 carry rule and re-add the known pairs: the witness (5) recomputes each sum against plain decimal arithmetic and turns red. The attack is real and it is caught.