#dusk $DUSK
Someone replied to my last Dusk post asking why I never explained the block reward split.
A FAIR CALLOUT👍.
So I went to whitepaper yesterday again, to answer it properly, and got stuck on a different section instead: how a block that just got voted on actually reaches everyone else fast enough to matter.
Staking decides who gets picked to vote.But picking the right validator solves nothing if their vote takes forever to reach the network.
That's what Kadcast is for.
Most blockchain networks broadcast the blunt way.
Gossip, where a node forwards to neighbors who forward to more neighbors, with a lot of duplicate transmission.
Kadcast is more structured.
It's built on Kademlia, the distributed hash table design used in peer-to-peer file systems, and routes messages based on how far nodes are from each other, not just who's nearby.
The number that surprised me: this gets roughly 25 to 50 percent less bandwidth usage than plain gossip, since nodes aren't blasting the same message at everyone in ran .
Someone replied to my last Dusk post asking why I never explained the block reward split.
A FAIR CALLOUT👍.
So I went to whitepaper yesterday again, to answer it properly, and got stuck on a different section instead: how a block that just got voted on actually reaches everyone else fast enough to matter.
Staking decides who gets picked to vote.But picking the right validator solves nothing if their vote takes forever to reach the network.
That's what Kadcast is for.
Most blockchain networks broadcast the blunt way.
Gossip, where a node forwards to neighbors who forward to more neighbors, with a lot of duplicate transmission.
Kadcast is more structured.
It's built on Kademlia, the distributed hash table design used in peer-to-peer file systems, and routes messages based on how far nodes are from each other, not just who's nearby.
The number that surprised me: this gets roughly 25 to 50 percent less bandwidth usage than plain gossip, since nodes aren't blasting the same message at everyone in ran .