The goal is that clients won't have to download the entire db to run the PoL but only need inclusion proofs for their coins.
Can't sparse Merkle trees be used for this?
Please Login to reply.
Yes, sparse merkle sum trees to be precise
