Proxima

Proxima presents a novel architecture for L1 distributed ledger commonly known as blockchain.
The ledger of Proxima is organized in the form of directed acyclic graph (DAG) with programmable UTXO transactions as vertices,
rather than as a chain of blocks. It uses a novel cooperative consensus on a DAG which is completely permissionless.

Proxima is looking for collaborators and contributors.

Cooperative consensus

The approach offers new unique features for the blockchain space (see highlights below). Proxima is neither PoW, nor a PoS system.
Its cooperative consensus combines best of both worlds in highly parallelized architecture:

it is as decentralized and permissionless as Bitcoin/PoW
it is as performant, cost and energy efficient as PoS systems, yet it does not need BFT committee and staking

Resources

Further information can be found through GitHub repository: https://github.com/lunfardo314/proxima, which includes:

Technical whitepaper with the concept details https://github.com/lunfardo314/proxima/blob/master/docs/Proxima_WP.pdf)
Advanced node prototype
README with introduction and other links
Contact information

The prototype node is built completely from scratch (not a fork). Its code (Golang) is light and highly parallelized.

Highlights of the architecture

Programmable UTXO tangle ledger, a transaction DAG instead of blockchain.
Novel cooperative consensus among token holders. Token holders are the sole participants in the network: no miners, no validators, no committees.
Consensus is fully permissionless and open-participation like Bitcoin/PoW. Ownership of tokens is the only prerequisite to participate in the consensus. No introduction or registration procedures of any kind.
Fairness. Every cooperating and contributing participant (token holder) receives inflation reward proportionally to it's holdings and time.
Sybil-protected by token holdings, PoS style, yet no staking, etc.
Leaderless determinism. There's no need for a consensus leader or block proposers. No MEV.
Nash equilibrium through the optimal strategy of biggest ledger coverage rule, an analog of the Bitcoin's longest chain rule.
The optimal strategy is cooperative among participants rather than competitive.
High throughput as a result of massive parallelism and the absence of global bottlenecks.
Low energy requirements, unlike PoW, similar to PoS.
Low cost per transaction, like PoS.
Asynchrony. The architecture relies only on weak assumptions of synchronicity.
Probabilistic finality. Depends on subjective assumptions, similar to 6-block rule in Bitcoin.
Parallelism at the consensus level. Assets converge to their finality states in parallel.
Parallelism at the node level. Independent transactions are validated independently. That enables efficient use of multi-core processors.

lunfardo314

Posts

Merits