--- Log opened Sat Dec 19 00:00:51 2020
03:01 < dergoegge> so from what i understood they reduce proof sizes by using the pareto distribution of the utxo life times and the idea is: keep the utxos sorted by creation time at all times, so that utxos that are more likely to be spend in the next block are grouped together in the smaller trees.
03:02 < dergoegge> so similar to what you are talking about 
03:02 < dergoegge>  he did not explain the deletion and addition in detail but he did say that they are using a different data structure called a "trie"
15:25 -!- kcalvinalvin [~kcalvinal@ec2-52-79-199-97.ap-northeast-2.compute.amazonaws.com] has quit [Ping timeout: 240 seconds]
15:26 -!- kcalvinalvin [~kcalvinal@ec2-52-79-199-97.ap-northeast-2.compute.amazonaws.com] has joined #utreexo
17:09 -!- jb55 [~jb55@gateway/tor-sasl/jb55] has quit [Ping timeout: 240 seconds]
17:16 -!- jb55 [~jb55@gateway/tor-sasl/jb55] has joined #utreexo
17:59 < ja> dergoegge: what is the context? this is the boltonb2 guy using tries for which application?
21:35 < kcalvinalvin> ja Yeah the guy wrote a paper and some code and gave a presentation at a meetup on zoom which Niklas and I joined
21:36 < kcalvinalvin> His idea is to keep the leaves never out of order
21:37 < kcalvinalvin> So just in-place forest basically
21:38 < kcalvinalvin> I've yet to digest the essay Tadge wrote above
21:39 < ja> kcalvinalvin: but is his application bitcoin? or something else?
21:40 < kcalvinalvin> bitcoin
21:40 < kcalvinalvin> But in general he didn't seem particularly focused on Bitcoin
21:40 < ja> hmm, and did he say if the paper will be out?
21:40 < kcalvinalvin> He called it "stateless clients" which irks me to no end
21:41 < kcalvinalvin> So I guess he likes Ethereum
21:41 < kcalvinalvin> Not sure. He didn't say
21:44 < ja> stateless heh, i don't know what it would mean in this context, isn't it all about maintaining state :O utxos are state
--- Log closed Sun Dec 20 00:00:52 2020