Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use solady to sort merkle tree #207

Merged
merged 1 commit into from
Oct 11, 2023

Conversation

andreivladbrg
Copy link
Member

Combining solady's LibSort and openzeppelin's Arrays libraries forced me(because we want to keep a good DX) to declare the merkle leaves as uint256 instead of bytes32, otherwise there would have been too many conversions between uint256->bytes32 and bytes32->uint256 arrays, plus conversions from storage to memory and vice versa.

@andreivladbrg andreivladbrg force-pushed the test/use-solady-to-sort branch from 443c811 to f0f08f4 Compare October 10, 2023 15:44
@PaulRBerg PaulRBerg merged commit 6d4da9c into refactor/double-hash Oct 11, 2023
7 checks passed
@PaulRBerg PaulRBerg deleted the test/use-solady-to-sort branch October 11, 2023 09:48
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants