--- Log opened Sun Jan 27 00:00:00 2013
00:39 < conseo> mcallan: if you have some time, i have put a first draft of my counting proposal in the wiki: http://zelea.com/w/User:4consensus_WebDe/Trees_of_Transactions
00:41 < conseo> forgive me my elaborate style and skip at will. also i have exams monday and tuesday in a week, which should give me more time finally
01:05 < conseo> (have just clearified usage of persistent to in memory after this concept: http://blog.higher-order.net/2009/09/08/understanding-clojures-persistenthashmap-deftwice/ )
01:26 < conseo> gn8
01:45 < mcallan> hey c, i'll have a look
01:46 < mcallan> (good luck studying)
01:47 < mcallan> (i mean good luck on exams)
01:47 < mcallan> n8
12:43 < conseo> mcallan: i have thought about the algorithm and the size of the voter registry (dominating bottle-neck because of linear space-complexity to amount of voters)
12:44 < conseo> we can distribute it for a billion users on a cluster of a thousand machines, allowing us to scale out not up (only adding network roundtrips for each candidate traversal, which will increase latency but not cost, because these steps depend on voter amount only logarithmatically)
12:45 < conseo> so, it should work out for any scale of vote counting imo
12:48 < conseo> maybe i'll add it later to the article
--- Log closed Mon Jan 28 00:00:17 2013