You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
commitments for suffix trees are evaluated by breaking each 32-byte value into two 16-byte words, and then adding 1^128 in front of one of these two words, so as to distinguish a leaf with value 0 from a missing leaf.
This 1^128 can be precomputed during the polynomial evaluation, in order to reduce the time taken by the multi explonentiation.
The text was updated successfully, but these errors were encountered:
commitments for suffix trees are evaluated by breaking each 32-byte value into two 16-byte words, and then adding
1^128
in front of one of these two words, so as to distinguish a leaf with value 0 from a missing leaf.This
1^128
can be precomputed during the polynomial evaluation, in order to reduce the time taken by the multi explonentiation.The text was updated successfully, but these errors were encountered: