--- Log opened Fri Dec 04 00:00:36 2020
04:50 < kcalvinalvin> hmmm what are the chances that the btcd guys accept a PR for the csn if I clean it up
06:59 < dergoegge> right now? i think pretty low, there are no bridge nodes and without pruning its not really use full.
07:02 < dergoegge> genproofs failed on the test server again. i tried inram this time. there is no error message it literally just says "Killed".
07:03 < dergoegge> ugh it did not write the cpu profile to disk
07:04 < dergoegge> i will try again on latest master with cow
07:04 < dergoegge> i am guessing it ran out of memory this time. but its only at height 370k and the server has 16GB hmm...
07:51 < adiabat> dergoegge: huh... maybe a memory leak...? 16GB seems like it should be enough
08:05 -!- reallll [~belcher@unaffiliated/belcher] has joined #utreexo
08:09 -!- belcher [~belcher@unaffiliated/belcher] has quit [Ping timeout: 272 seconds]
08:30 -!- reallll is now known as belcher
15:57 -!- jb55 [~jb55@gateway/tor-sasl/jb55] has quit [Ping timeout: 240 seconds]
16:03 < ja> dergoegge: left a comment about a lacking defer
16:08 < ja> adiabat: how did you come up with the node numbering scheme and the remTrans2 algorithm?  i am still trying to grasp how it works
16:09 < ja> the requirement must have been: if you have a forest, and some forest indexes, you should be able to develop remTrans2 :P but surely you developed the numbering scheme in parallel with the algorithm
16:09 < ja> so is it conceivable to have another numbering scheme, that would an analogue remTrans2?
16:10 < ja> *that would allow
16:11 -!- jb55 [~jb55@gateway/tor-sasl/jb55] has joined #utreexo
16:12 < ja> i keep working through your example from printout.txt line 21, and we talked about deleting leaves 4-9. but what does 4-9 really mean? one reformulation could be "all the leaves that are under node 25 or node 20"
16:13 < ja> another reformulation would be [tree 0, right branch], [tree 1, left branch]
--- Log closed Sat Dec 05 00:00:36 2020