Calvin Kim

> Hello, I just came to know about utreexo, found it interesting. I want to contribute or participate in the project. Can I know how to get started? Hey! At...

> Tried to fix the backward integration tests, but there is some issue with the upload artifact action as it can't detect files at the provided path. Ah it may...

> What `forestRows: 9` tells us? It means that the entire accumulator is 9 rows tall. ``` 30

Hey @theStack That's a good catch! I didn't check up on the comments closely. My excuse would be that there's a [new accumulator design](https://github.com/mit-dci/utreexo/discussions/249#discussioncomment-511407) that I'm [currently implementing](https://github.com/mit-dci/utreexo/pull/349) that allows...

With multi-block proof you only validate once when you ingest the multi-block proof. Ex: Before verifying block 10, you ingest the accumulator proof for blocks 10-19. You don't receive any...

Ok I think the issue is with the remembering with additions. I'm able to reproduce a simple example. ``` before block 7 modification: |-------------------------------\ 12:6ef3 |---------------\ |---------------\ 08:a7cb 09:0936 10:3859...

@adiabat The below code snippet recreates the error I had while testing the multi-block stuff. ``` func TestPollardNoSiblingFound(t *testing.T) { var p Pollard // Create the starting off pollard. adds...

One line change of ``` n.remember = remember ``` in the function `addOne()` makes all the tests pass (including the new test). Not sure if this is correct so I'll...

Mostly trying to get a `GetSize` function working for pollard for debugging so we can see how many bytes the pollard is taking up really. ``` func (n *polNode) GetSize(size...

> It's weird because the numbers seem close to 65K, not like millions / billions, suggesting that `numTargets` might actually be correct. > > But it can't be; `numTargets` should...