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

tiger: implement TTH algorithm #494

Draft
wants to merge 2 commits into
base: master
Choose a base branch
from
Draft

Commits on Jul 4, 2023

  1. Configuration menu
    Copy the full SHA
    55b0596 View commit details
    Browse the repository at this point in the history

Commits on Jul 5, 2023

  1. tiger: avoid alloc for calculating TTH

    Instead of storing every leaf and processing the tree once at the end,
    process the tree every time a leaf is added, so that a maximum of N
    nodes need to be stored, for a tree of height N. Then a final walk of
    the nodes is performed at the end to promote and merge any single-child
    leaves.
    baodrate committed Jul 5, 2023
    Configuration menu
    Copy the full SHA
    a3555de View commit details
    Browse the repository at this point in the history