Skip to content
Jasper den Ouden edited this page Jan 9, 2015 · 1 revision

Scalability is the No. 1. problem in cryptonomics. However, we will be happy if we solve it for just our system. (which needs voting and 1PerID, so it might end up fairly general-purpose)

The problem is that every full node must store and compute everything.

Note that Ethereum contracts themselves already may already have the possibility of some solution developed using just that. In general, it is a good idea to try figure out what it might look like as a contract, because 'a permanent contract is equivalent to a Ethereum feature'.

Brainstorm and potential Solutions

  • This hypercube approach, however, it assumes a fully fledged system, possibly beyond the scope of bitvote itself.

  • Tree Chains could use some looking into. That said, i expected to hear more from it by now if it sparkled with people. (TODO apparently more information came out?)

  • Hanging blocks: The main problem of it is with availability of the data corresponding to the Merkle roots. (a merkle tree implementation)

  • Aggregate signatures could help a lot, incorporating many votes into one. Improves-by-a-factor, not inherencly.

How to Test if Solutions Succeed

  • How it works in theory, and calculating how much space/bandwidth/cpu it takes.
  • How it withstands criticism/potential (technical)attacks.
  • We'll want to code up a PoC version.
Clone this wiki locally