Skip to content

Reduce the number of permutations in merkle tree leave hashing #1268

@ericnordelo

Description

@ericnordelo

In the poseidon hasher we can use h(x,y)=hades(x,y,2), which is 1 permutation less compared to state.update(x).update(y).finalize(), since the latter adds a permutation whenever we transition from odd --> even # of arguments (so only one so far) + another one for finalization.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    Status

    Backlog

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions