kayabaNerve / full-chain-membership-proofs

18 stars 1 forks source link

More efficient tree building by avoiding full Pedersen hash recalculation #69

Open kayabaNerve opened 12 months ago

kayabaNerve commented 12 months ago

If we have a branch with children A, B, the Pedersen hash is [A, B] * G. When we add C, we currently calculate [A, B, C] * G. We only have to calculate C * G which can be added to the existing hash.