The story of how we made Jolt 93% more memory efficient by leveraging sparsity probabilities but failed to achieve a 93% speed up. Several of the fundamental algorithms in Jolt operate over binary trees of 256-bit field elements. These things are massive, leaves on the order of
From Twitter
Disclaimer: The content above is only the author's opinion which does not represent any position of Followin, and is not intended as, and shall not be understood or construed as, investment advice from Followin.
Like
Add to Favorites
Comments
Share
Relevant content