CodeChain

After months of R&D, I am happy to share #Tenderand, a randomized leader election in #Tendermint that we have implemented on #CodeChain. The test results show that it can effectively defend against DOS attacks in public blockchains. Here is my entry! medium.com/codechain/tendera…

I finally implemented the randomized leader election in #CodeChain/Tendermint. The tests show VRF-based RLE works well; the random behavior cannot be distinguished from the "dev/urandom". The results can be found in research.codechain.io/t/rand…

4/ For more details, check out the proposal from Hyunsik. Feedback is welcome! #BLS #tendermint #BFT #Musig #codechain research.codechain.io/t/bls-…

3/ In #Tendermint, messages are constantly sent to each node, so it is hard to specify which nodes vote yes or no at a specific block height. As BLS signatures can be easily aggregated, non-interactively, we are planning to introduce them in our Tendermin implementation.

2/ A famous aggregation scheme is MuSig, which is used to aggregate Schnorr signatures that are currently used in #CodeChain because of its signing/verification speed. But MuSig has a problem cuz generating an aggregated signature requires the set of signers to be specified first

1/ One of the challenges Tendermint-based blockchains face is that as the size of the committee grows, the total size of all signatures as well as the block size also grow. An approach to solve this issue is to compress the signatures using signature aggregation technique.