Traditional proof-of-work (PoW), proof-of-stake (PoS), and other classical algorithms require a fierce competition to determine who gets to be the final ledger writer. PoW competes on computing power, PoS competes on the amount of money one has, and PBFT has high communication complexity and only applies to consortium chains and private chains.
Is there a solution that can ensure efficiency while avoiding this pointless competition? This is where Paralism Buddy algorithm comes in. The Buddy algorithm allows nodes that are related to business to form partnerships, confirm with each other, and generate consensus by finding the greatest common denominator. Ultimately, during the hyperblock stage, an overall consensus is formed, ensuring both efficiency and fairness in the whole process.
Produce by Paralism（www.paralism.com)
Support by hyperchain.net
Official website： www.paralism.com
Add Paranut Wechat and join our Wechat group
The text is for your reference:
Buddy Consensus-Form a global consensus
1
Last time we talked about
the one and only Hyper Block structure
And the algorithm for the hyper block
In the parallel system
Is also just so special
2
The one who invented the parallel blockchain
Also developed
The completely decentralized, the patented
Buddy Consensus
Which suites parallel blockchain system like no others
3
PoW, PoS and other classical algorithms
all involve competition
to select the final ledger writer
PoW competes computing power, and PoS competes stakes
PBFT is no better
It’s permissioned fault tolerance
Leaving outsiders no chance to have a say
4
Parallel system
All-inclusive, massive data
If you really rely on competition to finally decide a ledger writing right
That’s crazy
So, new approach is needed for parallel blockchain consensus
5
So many businesses in a parallel system
Why bother to put together
As long as the relevant business can reach local consensus
Then they can be put into collection
To form the global consensus
This will work for a large scale parallel blockchain.
6
Buddy consensus adopted this logic
Indicated by the name
Buddy consensus is all bout
Making friends
Which totally contrasts with how sequential chain reach consensus
The one who wins gets the right to write history!
7
Buddy algorithm, on the other hand
Is to form mutual consensus
Among business-related nodes partner
Then get the greatest common divisor of the recognition
That becomes the global consensus
In the phase of hyper block
8
This guarantees
Parallel business improves consensus efficiency
Permissionless participation and parallel block production for nodes ;
Node status equivalence
Avoid privileged nodes and waste of computing power
Complete decentralization
Suitable for parallel systems
9
For more details,
Check out the white paper at
I will see you in the next time!