mt.git - Merkletrees in Rust. Generate Merkle tree quickly for folders and raw data

	Commit message (Collapse)	Author	Age	Files	Lines
*	Add test on lib.rs	Santo Cariotti	2025-06-17	1	-1/+54
\|
*	test: add not valid proof example	Santo Cariotti	2025-06-17	1	-0/+17
\|
*	Avoid clone for pair also on proof	Santo Cariotti	2025-06-17	1	-5/+13
\|
*	Merkletree `.build()` in-place	Santo Cariotti	2025-06-17	1	-14/+25
\|
*	Use `.last()` for better readability	Santo Cariotti	2025-06-17	2	-3/+3
\|
*	Move struct in proper crate	Santo Cariotti	2025-06-16	2	-10/+13
\|
*	Remove feature	Santo Cariotti	2025-06-16	3	-43/+38
\|
*	Move proof tests and fix lifetime	Santo Cariotti	2025-06-16	3	-41/+51
\|
*	Use enumeration for left/right siblings	Santo Cariotti	2025-06-16	2	-33/+43
\|
*	Add proofer	Santo Cariotti	2025-06-16	5	-53/+234
\| \| \| \|	Also, avoid to request hasher on node creation
*	Remove `src/merkle` folder	Santo Cariotti	2025-06-16	4	-71/+66
\|
*	Rename `DefaultHasher` to `DummyHasher`	Santo Cariotti	2025-06-16	3	-4/+4
\|
*	Use bytes instead of string for data values	Santo Cariotti	2025-06-16	4	-21/+65
\|
*	docs: add	Santo Cariotti	2025-06-14	5	-6/+78
\|
*	fix(clippy): Box refs and modules imports	Santo Cariotti	2025-06-14	4	-9/+25
\|
*	Fix typo on "leaves" word	Santo Cariotti	2025-06-14	1	-8/+8
\|
*	Avoid to check if a pair has an even length	Santo Cariotti	2025-06-14	1	-6/+1
\| \| \| \|	This check can be avoided because we know for sure that we have a "even" number of leaves
*	Hasher with SHA256 algorithm is no more the default	Santo Cariotti	2025-06-14	2	-9/+20
\|
*	Init	Santo Cariotti	2025-06-13	5	-0/+202