<feed xmlns='http://www.w3.org/2005/Atom'>
<title>mt.git/src, branch main</title>
<subtitle>Merkletrees in Rust. Generate Merkle tree quickly for folders and raw data 
</subtitle>
<id>https://git.dcariotti.me/mt.git/atom?h=main</id>
<link rel='self' href='https://git.dcariotti.me/mt.git/atom?h=main'/>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/'/>
<updated>2025-09-29T16:03:06Z</updated>
<entry>
<title>Merkletree build method use `leaves` itself</title>
<updated>2025-09-29T16:03:06Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-09-29T16:03:06Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=82ddafa6d8337ba5c26d3780052f3b75a3d0dffa'/>
<id>urn:sha1:82ddafa6d8337ba5c26d3780052f3b75a3d0dffa</id>
<content type='text'>
</content>
</entry>
<entry>
<title>`build()` now uses the term "leaves" instead of "nodes"</title>
<updated>2025-09-24T19:22:31Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-09-24T19:22:31Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=d82144f5e9b72d89370532fb98a0a43e003b5c00'/>
<id>urn:sha1:d82144f5e9b72d89370532fb98a0a43e003b5c00</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Use levels, not leaves, to increase speed of proofing</title>
<updated>2025-09-04T12:09:00Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-09-04T12:09:00Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=42518b55cf65abbb048a2771ce0c173fa035bf33'/>
<id>urn:sha1:42518b55cf65abbb048a2771ce0c173fa035bf33</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Fix doc on lib</title>
<updated>2025-07-18T08:36:46Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-07-18T08:36:46Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=d45639ac4e589e14914722e54d589905caea1cff'/>
<id>urn:sha1:d45639ac4e589e14914722e54d589905caea1cff</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Do not duplicate the last node when elements are odd</title>
<updated>2025-07-17T09:00:53Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-07-17T09:00:53Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=9c4a1633559d45d9a57978de74fb75b937cdee70'/>
<id>urn:sha1:9c4a1633559d45d9a57978de74fb75b937cdee70</id>
<content type='text'>
</content>
</entry>
<entry>
<title>A faster way to find the sibling index for "proof"</title>
<updated>2025-07-16T14:15:51Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-07-16T14:15:51Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=ed89e47b756b24fa4f52fa62236e43d41e8f0882'/>
<id>urn:sha1:ed89e47b756b24fa4f52fa62236e43d41e8f0882</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Make tree for folders</title>
<updated>2025-07-07T15:14:12Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-07-07T15:14:12Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=5fb45710f57f95eec527958400f8ec0a049c5fe4'/>
<id>urn:sha1:5fb45710f57f95eec527958400f8ec0a049c5fe4</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Use `rayon` for parallelization</title>
<updated>2025-06-25T08:40:24Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-06-25T08:40:24Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=2ef7371f7a4eefe7478cad43cb4922efaa12876a'/>
<id>urn:sha1:2ef7371f7a4eefe7478cad43cb4922efaa12876a</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Proofer uses self hasher on `verify`</title>
<updated>2025-06-25T08:31:21Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-06-25T08:31:21Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=c402255ea5ef6510a583b79e49f4246dc618c362'/>
<id>urn:sha1:c402255ea5ef6510a583b79e49f4246dc618c362</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Increase tree's speed avoiding to store data in a vec</title>
<updated>2025-06-25T08:18:23Z</updated>
<author>
<name>Santo Cariotti</name>
<email>santo@dcariotti.me</email>
</author>
<published>2025-06-25T08:18:23Z</published>
<link rel='alternate' type='text/html' href='https://git.dcariotti.me/mt.git/commit/?id=7bdb59e386b93c37cdc2c2b88fc2945ab0e64d57'/>
<id>urn:sha1:7bdb59e386b93c37cdc2c2b88fc2945ab0e64d57</id>
<content type='text'>
</content>
</entry>
</feed>
