Implementation of a robust and scalable consensus protocol for - - PowerPoint PPT Presentation

implementation of a robust and scalable consensus
SMART_READER_LITE
LIVE PREVIEW

Implementation of a robust and scalable consensus protocol for - - PowerPoint PPT Presentation

Implementation of a robust and scalable consensus protocol for blockchain Raphal Dunant DEDIS lab Supervisors: Linus Gasser, Eleftherios Kokoris-Kogias Responsible: Prof. Bryan Ford Proposal cosigning Time or timestamp services


slide-1
SLIDE 1

Implementation of a robust and scalable consensus protocol for blockchain

Raphaël Dunant DEDIS lab Supervisors: Linus Gasser, Eleftherios Kokoris-Kogias Responsible: Prof. Bryan Ford

slide-2
SLIDE 2

2

Proposal cosigning

  • Time or timestamp services
  • Certificate Authorities (CAs)
  • Directory authorities
  • Software update services
  • Digital notaries
  • Randomness services
slide-3
SLIDE 3

3

Summary

  • Introduction (done)
  • CoSi protocol
  • Work done (challenges and found solutions)
  • Simulation results
  • Conclusion (results, lessons learned, etc.)
slide-4
SLIDE 4

4

CoSi: Decentralized Witness Cosigning

slide-5
SLIDE 5

6

CoSi: Decentralized Witness Cosigning

slide-6
SLIDE 6

7

Objectives

  • Have a solid implementation of the CoSi

protocol

  • Compatible with ONet and Kyber libraries
  • Handle failing nodes
  • Clean, tested and documented code
slide-7
SLIDE 7

8

Tree generation

slide-8
SLIDE 8

9

Failing nodes

slide-9
SLIDE 9

10

Multiple sub-protocols

slide-10
SLIDE 10

11

Unit tests and documentation

slide-11
SLIDE 11

12

Simulation results : complete working tree

  • 50ms delay, 10Mb/s bandwidth
  • 4 machines, 4x24 threads, 2.5 GHz, 4x30MB cache,

4x256GB DDR4-2133 RAM

slide-12
SLIDE 12

13

Simulation results : failing subleaders

  • 500 nodes,

√500 =22 subleaders ⌊ ⌋

  • 50ms delay,

10Mb/s bandwidth

  • 4 machines, 4x24 threads, 2.5 GHz, 4x30MB cache,

4x256GB DDR4-2133 RAM

slide-13
SLIDE 13

14

Simulation results : failing leafs

  • 500 nodes,

√500 =22 subleaders ⌊ ⌋

  • 50ms delay,

10Mb/s bandwidth

  • 4 machines, 4x24 threads, 2.5 GHz, 4x30MB cache,

4x256GB DDR4-2133 RAM

slide-14
SLIDE 14

15

Future work

  • BFT-CoSi
  • Handle root-node failure
  • Handle finely nodes

failures during runtime

  • Extend unit tests
  • Implement on a real blockchain
  • Use ONet v2
  • Use Omniledger’s Sharding Via Bias-Resistant

Distributed Randomness

slide-15
SLIDE 15

16

Conclusion

  • Complete and working CoSi implementation

with node failure

  • Easy to use, with documentation and examples
  • Lots of interest
  • Scalable and tested
  • Can still get better
  • Personal improvement