Slow and delayed transactions
Highly secure and decentralized networks often process very few transactions per second, leading to delays that make them unsuitable for everyday payments or real-time interactions.
Third presents a new blockchain approach designed for real-world use, near-instant transactions, minimal data load, security, and accessibility.
Add to cartAt the core of today’s limitations is the blockchain trilemma - the difficulty of achieving decentralization, security, and scalability all at once. Most systems can only deliver two, forcing trade-offs that limit real-world usability.
Whether it’s slower performance, higher costs, or reduced openness, most existing solutions reflect compromises driven by the trilemma, preventing blockchain technology from reaching its full global potential.
Highly secure and decentralized networks often process very few transactions per second, leading to delays that make them unsuitable for everyday payments or real-time interactions.
As transactions accumulate, blockchains grow continuously in size. This "data bloat" makes it harder for regular users to participate without large storage capacity or specialized setups.
Some newer systems improve speed, but only by requiring powerful and costly hardware. This reduces accessibility and shifts control toward a smaller group of well-equipped participants.
Instead of processing transactions one by one, the system allows many transactions to be handled at the same time. This removes delays and enables confirmations in under a second, making payments feel instant.
The network operates without relying on a single decision-maker. This reduces risks of manipulation or failure and ensures fairness, as no single participant controls transaction ordering or validation.
By using computing capabilities efficiently, the system achieves very high transaction capacity without requiring specialized or expensive machines, making it more inclusive and scalable.
Instead of storing all historical data, the system keeps only compact proofs that verify everything is correct. This keeps the network lightweight while preserving full trust and transparency.
The design supports massive transaction volumes and near-instant finality, making it suitable for global payments, connected devices, and emerging digital economies.
We use the latest academic advances to create the foundational pillars of a top performing blockchain network
At the heart of our system is a new, highly parallel consensus mechanism, that eliminates the need for strict global sequencing of all transactions.
Instead of a linear chain of blocks, we adopt a protocol where each node exchanges peer-to-peer "gossip" and probabilistically converges towards agreement. This eliminates the need for a central coordinator, allows concurrent validation of large batches of independent transactions, and removes the bottlenecks of strict sequencing.
The second key innovation is the intensive use of GPUs (graphics processors) and parallel computation to accelerate blockchain verification and execution tasks. GPUs excel at processing thousands of similar operations in parallel, which fits perfectly the simultaneous verification of cryptographic signatures, transactions, and proofs.
In our architecture, each validator node is equipped with an execution engine capable of leveraging parallel computation power (GPU or multi-core).
To solve the problem of blockchain size without compromising security, our architecture adopts distributed redundant storage. We implement a programmable redundancy scheme based on erasure codes. The data is split into fragments, with added redundancies that allow restoring the original record from any sufficient subset of fragments.
Instead of the entire history, each node stores only a fraction of blocks/transactions, plus possibly redundant pieces. Security is preserved because even if some nodes lack fragments, a coalition of honest nodes holds enough information to recombine the ledger.
Our blockchain periodically generates a succinct cryptographic proof certifying the validity of the entire history up to that point. This "zero-knowledge" proof attests that all past transactions are accounted for in the current state, without keeping the entire history. A new node can join the network by downloading only the proof and its compressed state.
We also implement a limited data retention policy. Sufficiently old and consolidated raw blocks get removed from the active chain after their integration into a zero knowledge proof. This ensures an ultra light ledger and allows the network to allocate more resources to current transactions.
Download our white paper for an in-depth analysis of the current ecosystem and why we offer Third as a game changing solution.
Add to cartThird strives to achieve unmatched results on all fronts: throughput, finality latency, security, and efficiency.
| Blockchain | TPS | Latency | Ledger size approach |
|---|---|---|---|
| Bitcoin | Approx. 7 | 60 min (probabilistic) | Full history, pruning only |
| Solana | Approx. 65 K | Approx. 1 s | Full replication, large size |
| Avalanche | Approx. 4.5 K | < 2 s | Full replication, large size |
| Third | Over 100 K | < 100 ms | Succinct + Ephemeral + Erasure coded |
If you want to know more, check our white paper for further reading and technical details.
Add to cart