--- Log opened Thu May 27 00:00:20 2021
10:31 < dergoegge> ah i meant subtree(16) (so the tree with 16 as root)
10:33 < dergoegge> and yes 16 moves to 28 but in the simplest version of the algo (iteratively remove each target) you would go 16 -> 24 and then 16 -> 28
10:34 < dergoegge> that could be heavy for a disk based forest
11:33 < adiabat> yeah I already have a function to condense those moves, so nothing needs to move more than once
11:34 < adiabat> but if we move all the hashes in a large subtree up, that could be a bunch of disk i/o.  
11:34 < adiabat> But it also feels "good" if you move large subtrees up, because then everything in that subtree now has a shorter proof and faster access
--- Log closed Thu May 27 16:27:35 2021
--- Log opened Thu May 27 16:27:35 2021
--- Log closed Thu May 27 16:48:47 2021
--- Log opened Thu May 27 16:48:47 2021
--- Log closed Thu May 27 16:59:04 2021
--- Log opened Thu May 27 16:59:04 2021
--- Log closed Thu May 27 17:05:55 2021
--- Log opened Thu May 27 17:05:55 2021
--- Log closed Fri May 28 00:00:21 2021