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
I think that the way that ENS domains did it makes sense
How we compute the input amount of chain and place it in the proof is done this way: bytes32 leaf = keccak256(abi.encodePacked(msg.sender, amount));
the leaf is the amount + the sender in a hashed keypair.
The merkle tree is computed off chain and only the proof is cerified on chain. This seems the most secure way to do on-chain proof.
I think that the way that ENS domains did it makes sense

How we compute the input amount of chain and place it in the proof is done this way:
bytes32 leaf = keccak256(abi.encodePacked(msg.sender, amount));
the leaf is the amount + the sender in a hashed keypair.
The merkle tree is computed off chain and only the proof is cerified on chain. This seems the most secure way to do on-chain proof.
They have a merkleproof library contract:
https://etherscan.io/address/0xc18360217d8f7ab5e7c516566761ea12ce7f9d72#code#F16#L1
The text was updated successfully, but these errors were encountered: