--- Log opened Sat Oct 30 00:00:18 2021
01:01 < devrandom> <devrandom> "I didn't understand the third..." <- oh, perhaps you are just saying that if the CSN is not interested in any specific UTXOs, it just needs the accumulator, which is the list of roots
02:49 < kcalvinalvin> devrandom:
02:49 < kcalvinalvin> > I think the second tree 
02:49 < kcalvinalvin> should have 11 (the parent of 06), not 10
02:49 < kcalvinalvin> 11 can be calculated by hashing 06 and 07
02:50 < kcalvinalvin> You need 10 because that's needed to hash up to 13
02:50 < kcalvinalvin> <devrandom> 
02:50 < kcalvinalvin> >"I didn't understand the third..." <- oh, perhaps you are just saying that if the CSN is not interested in any specific UTXOs, it just needs the accumulator, which is the list of roots
02:50 < kcalvinalvin> Yup
02:51 < kcalvinalvin> devrandom: 
02:51 < kcalvinalvin> >(seems like the update would be a lot simpler if we never compacted trees on deletes - I think you are calling that "swapless"?)
02:51 < kcalvinalvin> Yes
02:52 < kcalvinalvin> "swapless" comes from the fact that the current algorithm swaps nodes around to compact the tree. Probably should come up with a better name
03:16 < devrandom> <kcalvinalvin> "You need 10 because that's..." <- oh, right, of course, you need siblings not parents
23:32 < kcalvinalvin> Is the time changing in the US
23:32 < kcalvinalvin> So... different meeting time or..?
--- Log closed Sun Oct 31 00:00:19 2021