2018 Road Map


Analyse White Papers With Original Consensus Approaches.

  • Review, Analyse White Papers Of Leading Cryptocurrencies With Original Consensus Approaches.
  • Highlight things lacking in other cryptos, conduct extensive research into the consensus approaches, identify weaknesses.
  • Research and identify new and interesting consensus approaches undertaken by universities and academics.


Review & Analyse Academic Papers On Leading & Promising Consensus Approaches

  • Review, then analyse for strengths and weaknesses POW, POS, DPOS, DAG, Deterministic Consensus, Byzantine Fault Tolerance consensus models


Analyse The Strengths And Weaknesses Of Different Programming Languages

  • Investigate and Analyse programming languages and their potential applications in Blockchains and scripting languages, this lead to the identification of Haskell as being the ideal language to build the Dolla Blockchain in.


Review, Analysis And Testing Of LRSF BCCB Algorithm To Confirm Consensus Properties Align With Desired Blockchain Properties.

  • Conduct (More) performance tests using the simulator
  • Generative tests of the consensus algorithm using QuickCheck
  • Analysis on data size of voting rounds (small data, essentially yes/no votes) vs the distribution of the object to vote on (the block contents, large data, probably ~150B per transaction)


Transaction Approach

  • Analyze the benefits and drawbacks of UTxO ( Unspent Transaction Output ) and Account Balance Models.

On the blockchain we have made the choice to use the UTxO approach over the Account/Balance model for the following 2 reasons:


  • Using the UTxo Model allows us to process multiple UTxO’s at the same time,it enables parallel transactions and improves scalability.


  • We believe in being able to make private transactions and UTxO’s provide a higher level of privacy and allows us to implement enhanced privacy using ring signatures and other methods.


Coding And Construction Of The Dolla Blockchain

  • Simulator improvements (more things to measure, simulation of geo-distributed nodes)
  • Implementation of the missing timeouts logic
  • Diagram generation
  • Blockchain data structures and operations
  • Hashes and signatures
  • Networked node implementation
  • Tests
  • Basic GUI


Dolla Blockchain Testing

  • simulation testing multiple nodes (up to 100)
  • single constant latency – different node numbers
  • simulated geographically distributed node network
  • different node performance testing of throughput and transaction speeds, tests include variable network delays
  • testing of different block sizes
  • basic benchmark of signature schemes/algorithms


Node Network

  • Devops setup for geographically distributed testing of the networked node implementation and Blockchain performance


Formal Verification

  • Formal Verification of LRSF- BCCB, Coq proofs of important statements in the LRSF- BCCb Paper
  • Review of proofs by distributed systems expert
  • Formal verification of the approach


Consortium And Governance Approach

  • State overall goals that governance should uphold
  • Decide how fees should work and how high they should be or how they are to be changed in the future
  • Decide initial set of voters
  • Decide what new voters we want to incentivise joining
  • Decide what the hard requirements for being a voter are
  • Decide on inclusion process for new voters
  • Decide on rules on when a voter should be removed
  • Decide how voters can be removed
  • Decide how the consensus of the dynamically changing voter set should interact with the transaction consensus algorithm
  • Decide on guidelines users should react should they observe more than (t) byzantine nodes (e.g. recommend hard fork)


Dolla Blockchain Prototype Ready For Community Testing

  • Explanations on how to run and interpret simulator benchmarks


ICO Documentation

  • Whitepapers
  • Benchmarks
  • Building instructions
  • Running instructions
  • Explanations of what a realistic network setup should look like and how it should be configured
  • Less-technical explanations of the approach
  • Very-technical explanations of the approach
  • Documentation of all points from the above two “approach” sections


Lite Wallet

  • We have chosen to ICO with a Lite Wallet only.
  • Dolla uses deterministic consensus and therefore the block graph is really only one chain without any forks. Users of the currency do not need to download the full blockchain history in order to make transactions. They can instead ask (n-t) voters to learn a current balance and they can ask voters to pick a UTxO for them to sign. So a Lite Wallet without blockchain data is sufficient for this.


  • Implement Optional Private transactions
  • Explore options for private transactions including 12 Ring Confidential Transactions (RingCT) with minimum ring size (mixin) of 12 to conceal sources and amounts transferred, this makes it highly resistant to blockchain analysis.
  • Unlinkable Transactions
  • One Time Ring Signatures