Radix has been developed through 6 major iterations since its inception in 2013, beginning with a blockchain model and culminating with a fixed shard space and Cerberus.

THE MEME STUDIO | Web3 Marketing Agency

Page Sponsor: The Meme Studio: Web3 Marketing Agency

The Radix backstory by RADX.

The Radix backstory by RADX.

Timeline

KEY DATES EVENT
1979-07 Daniel Patrick Hughes was born in Stoke-on-Trent, England.
1984 Hughes’ father bought him a Spectrum Zx81 computer, which sparked his interest in coding.
2008-02-25 Hughes incorporated KDB Technology, a mobile technology company.
2011 Hughes heard about Bitcoin.
2013 Hughes forked the Bitcoin code to achieve a maximum of 1000 transactions per second (tps).
2013-2016 Hughes developed eMunie
2016-12-02 Hughes and Piers Ridyard incorporated Surematics, decentralised deal-room software for insurance companies.
2017-07-13 RDX Works incorporated.
2019-06-11 Tempo achieves over 1.4m tps on 1187 nodes.
2019-07-16 Radix Foundation incorporated.
2021-07-28 Radix ‘Olympia’ Mainnet launched.
2021-12-15 Radix ‘Alexandria’ developer environment launched.
2023-09-28 Radix ‘Babylon’ Mainnet launched.

Development History

From 2013, Dan Hughes began to experiment with various data structures and consensus mechanisms. Each iteration led to insights that have informed the current Radix architecture.

Radix Iteration 1: Blockchain (700-1000 tps)

In 2013, Hughes forked the Bitcoin codebase and experimented with different permutations of block size, block times, and hardware. These experiments established that the practical limit of blockchain throughput is approximately 700-1000 tps. A simple comparison with Visa at 24,000 tps meant that blockchains would never work as a global payments rail.

Further Reading

eMunie

Main Article: eMunie

eMunie was Hughes’ attempt to create a blockchain platform that would crack the trilemma of security, scalability, and speed. Although it consistently achieved 400 transactions per second and contained built-in mailing systems, chat rooms, and a proprietary marketplace, Hughes realized it still fell short.

Radix Iteration 2: Blocktree (200 tps)

The limits of monolithic blockchains led to Hughes’ first experiments with sharding in the form of a ‘blocktree’: a data structure of multiple, branching blockchains. At this stage, every branch had its own trust boundary, necessitating a complex messaging system to communicate between them. This led to the insight of grouping related transactions together into the same branch. Unfortunately, at around 200tps, any disagreements between branches led to an exponential rise in message complexity as the states reorganized.

Radix Iteration 3: Directed Acyclic Graph (DAG) (1500 tps)

Following on from projects like IOTA, Hughes started exploring Directed Acyclic Graphs (DAGs), which allow for parallel, asynchronous processing of transactions. This was also a move away from Proof-of-work (PoW) sybil protection. Ultimately, the lack of coordination between nodes made the DAG vulnerable to double-spend attacks.

Further Reading

Radix Iteration 4: Channeled Asynchronous State Tree (CAST) (2300 tps)