mt.git, branch main Merkletrees in Rust. Generate Merkle tree quickly for folders and raw data https://git.dcariotti.me/mt.git/atom?h=main 2025-09-29T16:03:06Z Merkletree build method use `leaves` itself 2025-09-29T16:03:06Z Santo Cariotti santo@dcariotti.me 2025-09-29T16:03:06Z urn:sha1:82ddafa6d8337ba5c26d3780052f3b75a3d0dffa `build()` now uses the term "leaves" instead of "nodes" 2025-09-24T19:22:31Z Santo Cariotti santo@dcariotti.me 2025-09-24T19:22:31Z urn:sha1:d82144f5e9b72d89370532fb98a0a43e003b5c00 Release 0.2.1 2025-09-09T12:35:42Z Santo Cariotti santo@dcariotti.me 2025-09-09T12:35:42Z urn:sha1:95ca7f2c3bcee434d4c7fba810117e305925e4d5 Release version 0.2.0 2025-09-04T12:10:03Z Santo Cariotti santo@dcariotti.me 2025-09-04T12:10:03Z urn:sha1:e165b1e925c433a4035add89f60f606a208c8572 Use levels, not leaves, to increase speed of proofing 2025-09-04T12:09:00Z Santo Cariotti santo@dcariotti.me 2025-09-04T12:09:00Z urn:sha1:42518b55cf65abbb048a2771ce0c173fa035bf33 Add license 2025-07-18T08:58:29Z Santo Cariotti santo@dcariotti.me 2025-07-18T08:57:09Z urn:sha1:bc89fb1bfc39276abb029c0774567dce18ee6666 Bump `rand 0.9.1` 2025-07-18T08:48:18Z Santo Cariotti santo@dcariotti.me 2025-07-18T08:48:18Z urn:sha1:00a004557eab1223a23445e0e69d89e62473165b Fix doc on lib 2025-07-18T08:36:46Z Santo Cariotti santo@dcariotti.me 2025-07-18T08:36:46Z urn:sha1:d45639ac4e589e14914722e54d589905caea1cff Do not duplicate the last node when elements are odd 2025-07-17T09:00:53Z Santo Cariotti santo@dcariotti.me 2025-07-17T09:00:53Z urn:sha1:9c4a1633559d45d9a57978de74fb75b937cdee70 A faster way to find the sibling index for "proof" 2025-07-16T14:15:51Z Santo Cariotti santo@dcariotti.me 2025-07-16T14:15:51Z urn:sha1:ed89e47b756b24fa4f52fa62236e43d41e8f0882