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
Once miniSTARK supports STARK friendly hash functions for proof commitments (see #11) I suspect the Merkle Tree generation will take up the bulk of proof generation time. Would be interesting to build a prototype Merkle Tree generated on the GPU using a hash function like Poseidon or Rescue.
The text was updated successfully, but these errors were encountered:
Once miniSTARK supports STARK friendly hash functions for proof commitments (see #11) I suspect the Merkle Tree generation will take up the bulk of proof generation time. Would be interesting to build a prototype Merkle Tree generated on the GPU using a hash function like Poseidon or Rescue.
The text was updated successfully, but these errors were encountered: