Logo

    Untitled

    Operation
    Hyperproofs cost
    Verkle trees cost (KZG, arity = B)
    Our cost
    Commit

    n 𝔾1

    ~ n 𝔾1

    Compute all proofs

    n log(n) 𝔾1

    ~n lgB

    Update digest

    1 𝔾1

    log⁑B(n)\log_B(n)logB​(n) 𝔾1

    Update all proofs (”state”)

    log n 𝔾1

    log⁑B(n)\log_B(n)logB​(n) 𝔾1

    Verify 1 proof

    log n β„™

    log⁑B(n)\log_B(n)logB​(n)β„™

    Aggregate m proofs

    m log n (𝔾1+𝔾2+β„™)

    Verify aggr. of m proofs

    m log n (𝔾2+𝔾T+β„™)

    no aggregation

    Size of one proof

    log n 𝔾1

    (log⁑B(n)(\log_B(n)(logB​(n)+1 ) 𝔾1

    Size of aggregated proof

    log(m log n) 𝔾T

    no aggregation

    Group requirements

    Aggregation

    via IPA (costly)

    no aggregation

    Updates

    Yes

    No updates

    Maintainability (update all)

    Yes

    Yes

    Compute/Update a fraction ⁍ of the tree

    O(Ξ±)O(\alpha)O(Ξ±)

    O(nlog⁑B)O(n \log B)O(nlogB)

    Total # of proofs in Verkle Trees

    NA

    Bd+Bdβˆ’1+...+BB^d + B^{d-1} + ... + BBd+Bdβˆ’1+...+B 𝔾1

    Notes

    NA

    d is depth of VT; B is branching factor. It holds that n=Bdn = B^dn=Bd, i.e., d=log⁑B(n)d = \log_B(n)d=logB​(n)

    CryptoNet is a Protocol Labs initiative.