The Byzantine Generals Problem, Plainly
Before it was the mathematics under every blockchain, it was a story problem. In 1982, Leslie Lamport, Robert Shostak, and Marshall Pease published a paper that opens like a war novel: several divisions of the Byzantine army are camped around an enemy city. The generals must agree on a common plan — attack or retreat — but they can communicate only by messenger, and some of the generals are traitors who will say anything to wreck the plan.
The question sounds simple: how do the loyal generals reach agreement when any message might be a lie?
Why it is harder than it looks
Your first instinct is voting. Every general sends his vote to every other general; majority wins. But a traitor does not have to vote once — he can tell one general "attack" and another "retreat," splitting the loyal camp into two groups, each convinced it holds the majority. Add relayed messages ("General three told me he votes attack") and the lying compounds: now a traitor can misreport other people's votes too.
The paper's famous result puts a number on the difficulty: with plain messages, agreement is possible only if more than two-thirds of the generals are loyal. Three generals cannot survive one traitor. Four can. The result is not about armies, of course. Replace generals with computers, messengers with networks, and traitors with crashed, buggy, or malicious machines, and you have the fundamental problem of distributed systems: getting independent parties to agree on a single version of events when some of the parties cannot be trusted.
From war story to infrastructure
Solutions to the problem became known as Byzantine fault tolerance — BFT. For decades it lived in places where failure was not an option and trust could not be assumed: flight control systems, nuclear plants, spacecraft. Then, in 2008, it escaped the laboratory. A ledger maintained by thousands of strangers, none of whom trust each other, some of whom are actively hostile, all of whom must nevertheless agree on who owns what: that is the Byzantine Generals Problem restated as money. Every blockchain consensus mechanism in operation today — proof of work, proof of stake, and the committee-based BFT protocols underneath networks like Hedera, where I served on the governing council — is an answer to Lamport's riddle.
I spent twenty-five years in payments before any of this had a token attached, and here is the thing practitioners understand that whitepapers rarely say: the traditional rails answer the same question, just with lawyers instead of math. Card networks, correspondent banking, settlement systems — each is an elaborate machine for letting parties who do not trust each other agree on a balance, with contracts, reconciliation, and liability rules playing the role the consensus algorithm plays on-chain. BFT did not invent the problem. It replaced the paperwork with proof.
Why a holding company carries this name
Our company is named for a coin and a problem — the solidus, which proved durable money is achievable, and the Generals, who proved trust can be engineered among parties with no reason to extend it. Those are the two halves of our thesis: durability is a policy, and the policy is enforceable by construction rather than by promise.
The empire gave us the coin. The problem named for it gave us the consensus. Everything we build answers to both.