Skip to content

Add loss due to number of non-recursive proofs #58

@b-wagn

Description

@b-wagn

According to the discussion we had with Ale, the error $\epsilon$ of the full recursive zkVM should be written as $\sum_{C} m_C \epsilon_C$, where $C$ ranges over all circuits and $m_C$ denotes the multiplicity of the circuit, i.e., an upper bound of the number of invocations of $C$ in the recursion topology. In words: if I want to break the zkVM security, I can either break non-recursive component 1, or non-recursive component 2, or ....

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type
    No fields configured for issues without a type.

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions