At first I assumed Dusk’s private leader selection was mostly about hiding who gets to propose the next block. But the more I looked, the quieter dependency seemed to be elsewhere. Proof-of-Blind Bid lets a participant calculate a leader score from a hidden bid and prove that score without exposing the stake amount or identity. The part that stayed with me is how the system decides whether that score is high enough. The whitepaper assumes a score threshold is dynamically computed for each epoch, with the target tied to the average number of leaders expected per round-step. But the concrete threshold function is explicitly left beyond the paper’s scope. That does not make the mechanism unsound. It does mean leader-selection behavior depends on a parameter-setting process that sits outside the cryptographic proof itself. In practice, that boundary matters because private selection still needs a shared idea of what counts as enough eligible leaders. So the real question isn’t whether the bid is hidden. It’s who ultimately defines the threshold that hidden bids are judged against?

#DuskNetwork #ProofOfStake $DUSK @Dusk #dusk