4.8/5 - (63 votes)

Binary code feels like a pure invention of the computer age. It isn’t. The same two-symbol system running every screen you look at showed up in unrelated cultures thousands of years before anyone thought about circuits.

Only two symbols, and that’s the whole point

Binary uses just two digits, 0 and 1, called bits. Every bit sits in a position that stands for a growing power of two, the same way each digit in a normal number stands for a power of ten.

That simplicity is exactly why it works so well inside a computer. A circuit only has to tell the difference between off and on, nothing in between, which makes binary remarkably easy to build in hardware. It also handles basic logic operations like and, or and not directly on strings of bits.

An ancient Chinese text arranged its symbols the same way

Centuries before any European mathematician wrote a line of binary, the Chinese I Ching already used a notation strikingly close to it, as far back as the 9th century BC, for divination rather than math.

In the 11th century, the scholar Shao Yong went further and reorganized the I Ching’s hexagrams into a layout that resembles modern binary numbers almost exactly, even though he never used it to calculate anything.

Similar near-binary systems appeared even earlier elsewhere. Ancient Egypt used binary-like fractions tied to the Eye of Horus around 2400 BC, and the Indian scholar Pingala worked with comparable binary patterns around the 2nd century BC.

Leibniz didn’t work this out alone

Gottfried Wilhelm Leibniz is usually credited as the inventor of binary math, publishing his first work on binary progression in 1679 and a fuller treatise in 1703.

See also  A mathematician doodled during a boring meeting and found a hidden prime number pattern

But around 1700, Leibniz was corresponding with Joachim Bouvet, a Jesuit missionary and expert on the I Ching. Leibniz was startled to realize that the ancient Chinese system amounted to a parallel invention of his own notation, arrived at completely independently on the other side of the world.

Two breakthroughs, a century apart, made it the language of machines

Binary numbers alone don’t build a computer. That leap needed George Boole, a British mathematician who published an algebraic system of logic in 1854, now known as Boolean algebra, built entirely around true and false statements.

Boole’s work sat purely on paper until 1937, when Claude Shannon, then a graduate student at MIT, wrote a thesis showing that Boolean algebra could describe electrical switching circuits made of simple relays and switches. That single paper became the theoretical foundation every digital circuit still relies on today.

The first binary computer was built on a kitchen table

That same year, Bell Labs engineer George Stibitz put the idea into practice with a relay based calculator that could add numbers in binary. He built it, quite literally, on his own kitchen table, which is why he nicknamed it the Model K.

Three years later, on September 11, 1940, a more advanced version of that machine became the first computer in history ever operated remotely, controlled over a simple telephone line during a public demonstration at Dartmouth College.

The same zeros and ones, thousands of years apart

An oracle in ancient China, a philosopher in 17th century Germany, and an engineer working from his own kitchen all arrived at the same basic idea from completely different directions. Binary code didn’t start with computers, it just finally found its perfect home in them.

See also  She signed her math letters as a man, and fooled Gauss for years