summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* Merkletree build method use `leaves` itselfHEADmainSanto Cariotti2025-09-291-27/+15
|
* `build()` now uses the term "leaves" instead of "nodes"Santo Cariotti2025-09-241-3/+2
|
* Release 0.2.1Santo Cariotti2025-09-092-2/+2
|
* Release version 0.2.0Santo Cariotti2025-09-042-2/+2
|
* Use levels, not leaves, to increase speed of proofingSanto Cariotti2025-09-041-28/+30
|
* Add licenseSanto Cariotti2025-07-182-0/+31
|
* Bump `rand 0.9.1`Santo Cariotti2025-07-183-14/+38
|
* Fix doc on libSanto Cariotti2025-07-181-1/+1
|
* Do not duplicate the last node when elements are oddSanto Cariotti2025-07-171-13/+5
|
* A faster way to find the sibling index for "proof"Santo Cariotti2025-07-161-17/+8
|
* Make tree for foldersSanto Cariotti2025-07-077-45/+97
|
* Use `rayon` for parallelizationSanto Cariotti2025-06-256-26/+40
|
* Proofer uses self hasher on `verify`Santo Cariotti2025-06-255-37/+41
|
* Increase tree's speed avoiding to store data in a vecSanto Cariotti2025-06-255-33/+14
|
* Add readmeSanto Cariotti2025-06-241-0/+135
|
* Add proofer exampleSanto Cariotti2025-06-231-0/+47
|
* fix: typo on a commentSanto Cariotti2025-06-231-1/+1
|
* Add example which returns the root hash of a MT using Blake3Santo Cariotti2025-06-231-0/+28
|
* Add `Blake3Hasher`Santo Cariotti2025-06-234-24/+125
|
* Add `Keccak512Hasher`Santo Cariotti2025-06-234-6/+111
|
* benches: fix typo on documentationSanto Cariotti2025-06-181-2/+2
|
* bench(bigfiles): Simpler way to define filenamesSanto Cariotti2025-06-171-16/+5
|
* Add benchesSanto Cariotti2025-06-174-1/+760
|
* Add test on lib.rsSanto Cariotti2025-06-176-3/+56
|
* test: add not valid proof exampleSanto Cariotti2025-06-171-0/+17
|
* Avoid clone for pair also on proofSanto Cariotti2025-06-171-5/+13
|
* Merkletree `.build()` in-placeSanto Cariotti2025-06-171-14/+25
|
* Use `.last()` for better readabilitySanto Cariotti2025-06-172-3/+3
|
* Move struct in proper crateSanto Cariotti2025-06-162-10/+13
|
* Remove featureSanto Cariotti2025-06-164-49/+40
|
* Move proof tests and fix lifetimeSanto Cariotti2025-06-163-41/+51
|
* Use enumeration for left/right siblingsSanto Cariotti2025-06-162-33/+43
|
* Add prooferSanto Cariotti2025-06-165-53/+234
| | | | Also, avoid to request hasher on node creation
* Remove `src/merkle` folderSanto Cariotti2025-06-164-71/+66
|
* Add CISanto Cariotti2025-06-161-0/+23
|
* Rename `DefaultHasher` to `DummyHasher`Santo Cariotti2025-06-164-4/+14
|
* Use bytes instead of string for data valuesSanto Cariotti2025-06-164-21/+65
|
* docs: addSanto Cariotti2025-06-145-6/+78
|
* fix(clippy): Box refs and modules importsSanto Cariotti2025-06-144-9/+25
|
* Fix typo on "leaves" wordSanto Cariotti2025-06-141-8/+8
|
* Avoid to check if a pair has an even lengthSanto Cariotti2025-06-141-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 defaultSanto Cariotti2025-06-143-11/+26
|
* InitSanto Cariotti2025-06-138-0/+312
generated by cgit v1.2.3-71-g8e6c (git 2.46.0) at 2026-01-15 05:25:56 +0000