Algorithm 4 problems

[Alexander Chepurnoy]

While Figure 2 and textual description are saying that a proof starts with a superchain having "m" blocks at least ("At the highest possible level at which at least $m$ blocks, all these blocks are presented"), there is no such check in the Algorithm 4. Actually, the algorithm starts with the second superchain from the top found in a k-depth block (the first one is to be handled before While loop and so not reaching line 13).

[Dionysis Zindros]

@kushti You are right with regards to the fact that $\tilde\Pi$ is not including the top-level superchain; I have changed the algorithm to fix this. Thank you!

With regards to the check for at least $m$ blocks, this check is actually not required. However, I understand that the wording of the paper does not make this at all clear. I have added a paragraph below Algorithm 4 explaining my case. Please let me know if this is now clear to you or if I should try to reword it further.