A Trusted Reference String (TRS) is a set of publicly verifiable parameters generated during an initial setup phase for certain zero-knowledge proof systems, such as SNARKs. This string is crucial for both the prover to construct a valid proof and the verifier to check its correctness. The security of the system relies on the assumption that the TRS was generated honestly and its secret components were securely destroyed.
Context
The generation of a Trusted Reference String is often a point of discussion and concern in the deployment of SNARK-based blockchain solutions, due to the requirement of a trusted third party or a multi-party computation ceremony. Efforts are underway to develop “transparent” SNARKs that do not require a TRS, or to improve the security and decentralization of TRS generation processes. News frequently discusses the implications of trusted setups for the overall decentralization and security of these systems.
Fractal Commitment Schemes introduce a recursive commitment primitive that compresses the universal trusted setup into a constant size, dramatically accelerating verifiable computation deployment.
We use cookies to personalize content and marketing, and to analyze our traffic. This helps us maintain the quality of our free resources. manage your preferences below.
Detailed Cookie Preferences
This helps support our free resources through personalized marketing efforts and promotions.
Analytics cookies help us understand how visitors interact with our website, improving user experience and website performance.
Personalization cookies enable us to customize the content and features of our site based on your interactions, offering a more tailored experience.
