The Ultimate Guide to Zero-Knowledge Proofs: zk-SNARKs vs zk-STARKs

Paulina Lewandowska

14 Apr 2023
The Ultimate Guide to Zero-Knowledge Proofs: zk-SNARKs vs zk-STARKs

Introduction

As blockchain and cryptocurrency have risen in popularity, zero-knowledge proofs have become increasingly important in cryptography. These types of proofs allow for one party to prove they know certain information without actually revealing the information, making them useful for confidential transactions. In this blog post, we will compare the differences between the two most commonly used kinds of zero-knowledge proofs: zk-SNARKs vs zk-STARKs.

What are Zero Knowledge Proofs?

In cryptography, zero-knowledge proofs are a type of protocol that enables one party to prove to another party that a statement is true without revealing any additional information beyond the statement's truthfulness. In other words, zero-knowledge proofs allow one party to demonstrate knowledge of a particular fact without disclosing any other information that could be used to derive the same knowledge. This makes them useful for applications that require secure and private transactions, such as in blockchain and cryptocurrency, where they can be used to verify transactions without revealing any sensitive information. Zero-knowledge proofs are becoming increasingly important in cryptography due to their potential applications in privacy-preserving systems and secure transactions.

In the Mina Protocol video below, you will learn more details:

https://www.youtube.com/watch?v=GvwYJDzzI-g&pp=ygUVWmVyby1Lbm93bGVkZ2UgUHJvb2Zz

Zk-SNARKs vs zk-STARKs: what’s the difference?

In the realm of zero-knowledge proofs, there are two types: k-SNARKs and zk-STARKs. The distinguishing factor between the two lies in their approach to generating proofs. While zk-SNARKs utilize a trusted setup in which a group of trusted individuals generate a set of public parameters to generate proofs that can be reused indefinitely, zk-STARKs employ a more computationally intensive method that negates the need for a trusted setup.

Zk-SNARKs vs zk-STARKs

When comparing Zk-SNARKs and zk-STARKs, one key difference is their level of transparency. Zk-SNARKs are considered less transparent than zk-STARKs due to their reliance on a secret key that is only known to trusted setup participants, which could compromise the system's security if leaked or compromised. However, zk-STARKs are completely transparent and don't rely on assumptions or secret keys, making them more appealing to those who prioritize both transparency and security.

In terms of proof generation time and size, Zk-SNARKs are generally less efficient than zk-STARKs. However, zk-STARKs have the advantage of scalability and can handle more complex computations. Additionally, zk-STARKs are post-quantum secure, while Zk-SNARKs are not, making them resistant to attacks from quantum computers. Another important consideration is that zk-STARKs are more scalable and can handle larger computations compared to zk-SNARKs.

Zk-SNARKs explained

Zk-SNARKs have become increasingly popular due to their efficiency and privacy-preserving features, making them applicable in various real-life scenarios such as in blockchain, where they can be deployed to prove ownership of digital assets without revealing sensitive information. Additionally, Zk-SNARKs have played a crucial role in voting systems by ensuring the accurate counting of votes while maintaining voter anonymity. One of the most notable applications of Zk-SNARKs can be observed in Zcash, a private cryptocurrency, which allows users to transact anonymously while concealing transaction data. However, concerns about potential security risks have been raised regarding the use of trusted setups in Zk-SNARKs, as a compromised trusted setup can put the entire system's privacy at risk.

Zk-STARKs explained

Rather than requiring a trusted setup like zk-SNARKs do, zk-STARKs were developed as a better alternative, which is more resistant to attacks. This is because the trusted setup of zk-SNARKs is vulnerable to malicious use should it be compromised. Despite this, zk-STARKs require more calculations to generate a proof, making them less efficient overall. Still, recent developments have paved the way for more efficient zk-STARKs, making it a promising replacement to zk-SNARKs.

According to their use cases, zk-SNARKs and zk-STARKs differ not only in efficiency and trusted setups. Applications that require fast and efficient proof verification, such as privacy-preserving transactions in cryptocurrencies, typically use zk-SNARKs. In contrast, zk-STARKs are more appropriate for applications that require transparency and no trusted setup, such as voting systems and decentralized autonomous organizations (DAOs). Additionally, it's worth noting that although zk-SNARKs and zk-STARKs are the most prominent types of zero-knowledge proofs, there are other variants such as Bulletproofs and Aurora that offer different trade-offs in efficiency and security, depending on the specific use case.

How to implement zk proof in the project?

When implementing zero-knowledge proof in a project, there are various technical steps involved, and depending on the type of zero-knowledge proof used, different methods and tools are available, such as zk-SNARKs vs zk-STARKs. For instance, when using zk-SNARKs, developers must utilize a trusted setup to produce the public parameters that will be used to generate and authenticate the proofs. The process requires the selection of the appropriate trusted setup ceremony, the setup of necessary infrastructure and assigning the participants who will generate the parameters. After the trusted setup, developers must include the appropriate libraries such as libsnark in their code and develop the functions required to generate and authenticate the proofs.

When it comes to zk-STARKs, a different approach is necessary for developers since trusted setup isn't required. To prove the computations, they need to utilize tools like circom and snarkjs to generate the circuits and tools such as groth16 and marlin to verify and generate the proofs. This includes choosing the appropriate tools and libraries, creating circuits, and ensuring full implementation of verification functions and proof generation.

A deep understanding of the cryptographic protocols involved, as well as having access to the necessary tools and libraries, are crucial requirements for developers when implementing zero-knowledge proof in a project. Additionally, developers must ensure that the proofs generated by the system are correct, secure, and efficient without compromising the users' privacy or security. Testing and debugging play a critical role during the process, and developers must ensure the system undergoes thorough testing before deploying it to production.

Conclusion

Zero-knowledge proofs have become increasingly crucial in cryptography, particularly in blockchain and cryptocurrency. The most commonly used types of zero-knowledge proofs are zk-SNARKs and zk-STARKs, which vary in their approach to generating proofs, level of transparency, proof generation time and size, scalability, and post-quantum security. To implement zero-knowledge proof in a project, developers must possess a thorough understanding of the cryptographic protocols employed, access to the necessary tools and libraries, and ensure the system undergoes comprehensive testing before deployment. Different technical steps and methods are required depending on the zero-knowledge proof used. As the use of zero-knowledge proofs continues to expand, comprehending the trade-offs between different types and effectively implementing them in various applications while safeguarding privacy and security is of utmost importance.

Most viewed


Never miss a story

Stay updated about Nextrope news as it happens.

You are subscribed

Applying Game Theory in Token Design

Kajetan Olas

16 Apr 2024
Applying Game Theory in Token Design

Blockchain technology allows for aligning incentives among network participants by rewarding desired behaviors with tokens.
But there is more to it than simply fostering cooperation. Game theory allows for designing incentive-machines that can't be turned-off and resemble artificial life.

Emergent Optimization

Game theory provides a robust framework for analyzing strategic interactions with mathematical models, which is particularly useful in blockchain environments where multiple stakeholders interact within a set of predefined rules. By applying this framework to token systems, developers can design systems that influence the emergent behaviors of network participants. This ensures the stability and effectiveness of the ecosystem.

Bonding Curves

Bonding curves are tool used in token design to manage the relationship between price and token supply predictably. Essentially, a bonding curve is a mathematical curve that defines the price of a token based on its supply. The more tokens that are bought, the higher the price climbs, and vice versa. This model incentivizes early adoption and can help stabilize a token’s economy over time.

For example, a bonding curve could be designed to slow down price increases after certain milestones are reached, thus preventing speculative bubbles and encouraging steadier, more organic growth.

The Case of Bitcoin

Bitcoin’s design incorporates game theory, most notably through its consensus mechanism of proof-of-work (PoW). Its reward function optimizes for security (hashrate) by optimizing for maximum electricity usage. Therefore, optimizing for its legitimate goal of being secure also inadvertently optimizes for corrupting natural environment. Another emergent outcome of PoW is the creation of mining pools, that increase centralization.

The Paperclip Maximizer and the dangers of blockchain economy

What’s the connection between AI from the story and decentralized economies? Blockchain-based incentive systems also can’t be turned off. This means that if we design an incentive system that optimizes towards a wrong objective, we might be unable to change it. Bitcoin critics argue that the PoW consensus mechanism optimizes toward destroying planet Earth.

Layer 2 Solutions

Layer 2 solutions are built on the understanding that the security provided by this core kernel of certainty can be used as an anchor. This anchor then supports additional economic mechanisms that operate off the blockchain, extending the utility of public blockchains like Ethereum. These mechanisms include state channels, sidechains, or plasma, each offering a way to conduct transactions off-chain while still being able to refer back to the anchored security of the main chain if necessary.

Conceptual Example of State Channels

State channels allow participants to perform numerous transactions off-chain, with the blockchain serving as a backstop in case of disputes or malfeasance.

Consider two players, Alice and Bob, who want to play a game of tic-tac-toe with stakes in Ethereum. The naive approach would be to interact directly with a smart contract for every move, which would be slow and costly. Instead, they can use a state channel for their game.

  1. Opening the Channel: They start by deploying a "Judge" smart contract on Ethereum, which holds the 1 ETH wager. The contract knows the rules of the game and the identities of the players.
  2. Playing the Game: Alice and Bob play the game off-chain by signing each move as transactions, which are exchanged directly between them but not broadcast to the blockchain. Each transaction includes a nonce to ensure moves are kept in order.
  3. Closing the Channel: When the game ends, the final state (i.e., the sequence of moves) is sent to the Judge contract, which pays out the wager to the winner after confirming both parties agree on the outcome.

A threat stronger than the execution

If Bob tries to cheat by submitting an old state where he was winning, Alice can challenge this during a dispute period by submitting a newer signed state. The Judge contract can verify the authenticity and order of these states due to the nonces, ensuring the integrity of the game. Thus, the mere threat of execution (submitting the state to the blockchain and having the fraud exposed) secures the off-chain interactions.

Game Theory in Practice

Understanding the application of game theory within blockchain and token ecosystems requires a structured approach to analyzing how stakeholders interact, defining possible actions they can take, and understanding the causal relationships within the system. This structured analysis helps in creating effective strategies that ensure the system operates as intended.

Stakeholder Analysis

Identifying Stakeholders

The first step in applying game theory effectively is identifying all relevant stakeholders within the ecosystem. This includes direct participants such as users, miners, and developers but also external entities like regulators, potential attackers, and partner organizations. Understanding who the stakeholders are and what their interests and capabilities are is crucial for predicting how they might interact within the system.

Stakeholders in blockchain development for systems engineering

Assessing Incentives and Capabilities

Each stakeholder has different motivations and resources at their disposal. For instance, miners are motivated by block rewards and transaction fees, while users seek fast, secure, and cheap transactions. Clearly defining these incentives helps in predicting how changes to the system’s rules and parameters might influence their behaviors.

Defining Action Space

Possible Actions

The action space encompasses all possible decisions or strategies stakeholders can employ in response to the ecosystem's dynamics. For example, a miner might choose to increase computational power, a user might decide to hold or sell tokens, and a developer might propose changes to the protocol.

Artonomus, Github

Constraints and Opportunities

Understanding the constraints (such as economic costs, technological limitations, and regulatory frameworks) and opportunities (such as new technological advancements or changes in market demand) within which these actions take place is vital. This helps in modeling potential strategies stakeholders might adopt.

Artonomus, Github

Causal Relationships Diagram

Mapping Interactions

Creating a diagram that represents the causal relationships between different actions and outcomes within the ecosystem can illuminate how complex interactions unfold. This diagram helps in identifying which variables influence others and how they do so, making it easier to predict the outcomes of certain actions.

Artonomus, Github

Analyzing Impact

By examining the causal relationships, developers and system designers can identify critical leverage points where small changes could have significant impacts. This analysis is crucial for enhancing system stability and ensuring its efficiency.

Feedback Loops

Understanding feedback loops within a blockchain ecosystem is critical as they can significantly amplify or mitigate the effects of changes within the system. These loops can reinforce or counteract trends, leading to rapid growth or decline.

Reinforcing Loops

Reinforcing loops are feedback mechanisms that amplify the effects of a trend or action. For example, increased adoption of a blockchain platform can lead to more developers creating applications on it, which in turn leads to further adoption. This positive feedback loop can drive rapid growth and success.

Death Spiral

Conversely, a death spiral is a type of reinforcing loop that leads to negative outcomes. An example might be the increasing cost of transaction fees leading to decreased usage of the blockchain, which reduces the incentive for miners to secure the network, further decreasing system performance and user adoption. Identifying potential death spirals early is crucial for maintaining the ecosystem's health.

The Death Spiral: How Terra's Algorithmic Stablecoin Came Crashing Down
the-death-spiral-how-terras-algorithmic-stablecoin-came-crashing-down/, Forbes

Conclusion

The fundamental advantage of token-based systems is being able to reward desired behavior. To capitalize on that possibility, token engineers put careful attention into optimization and designing incentives for long-term growth.

FAQ

  1. What does game theory contribute to blockchain token design?
    • Game theory optimizes blockchain ecosystems by structuring incentives that reward desired behavior.
  2. How do bonding curves apply game theory to improve token economics?
    • Bonding curves set token pricing that adjusts with supply changes, strategically incentivizing early purchases and penalizing speculation.
  3. What benefits do Layer 2 solutions provide in the context of game theory?
    • Layer 2 solutions leverage game theory, by creating systems where the threat of reporting fraudulent behavior ensures honest participation.

Token Engineering Process

Kajetan Olas

13 Apr 2024
Token Engineering Process

Token Engineering is an emerging field that addresses the systematic design and engineering of blockchain-based tokens. It applies rigorous mathematical methods from the Complex Systems Engineering discipline to tokenomics design.

In this article, we will walk through the Token Engineering Process and break it down into three key stages. Discovery Phase, Design Phase, and Deployment Phase.

Discovery Phase of Token Engineering Process

The first stage of the token engineering process is the Discovery Phase. It focuses on constructing high-level business plans, defining objectives, and identifying problems to be solved. That phase is also the time when token engineers first define key stakeholders in the project.

Defining the Problem

This may seem counterintuitive. Why would we start with the problem when designing tokenomics? Shouldn’t we start with more down-to-earth matters like token supply? The answer is No. Tokens are a medium for creating and exchanging value within a project’s ecosystem. Since crypto projects draw their value from solving problems that can’t be solved through TradFi mechanisms, their tokenomics should reflect that. 

The industry standard, developed by McKinsey & Co. and adapted to token engineering purposes by Outlier Ventures, is structuring the problem through a logic tree, following MECE.
MECE stands for Mutually Exclusive, Collectively Exhaustive. Mutually Exclusive means that problems in the tree should not overlap. Collectively Exhaustive means that the tree should cover all issues.

In practice, the “Problem” should be replaced by a whole problem statement worksheet. The same will hold for some of the boxes.
A commonly used tool for designing these kinds of diagrams is the Miro whiteboard.

Identifying Stakeholders and Value Flows in Token Engineering

This part is about identifying all relevant actors in the ecosystem and how value flows between them. To illustrate what we mean let’s consider an example of NFT marketplace. In its case, relevant actors might be sellers, buyers, NFT creators, and a marketplace owner. Possible value flow when conducting a transaction might be: buyer gets rid of his tokens, seller gets some of them, marketplace owner gets some of them as fees, and NFT creators get some of them as royalties.

Incentive Mechanisms Canvas

The last part of what we consider to be in the Discovery Phase is filling the Incentive Mechanisms Canvas. After successfully identifying value flows in the previous stage, token engineers search for frictions to desired behaviors and point out the undesired behaviors. For example, friction to activity on an NFT marketplace might be respecting royalty fees by marketplace owners since it reduces value flowing to the seller.

source: https://www.canva.com/design/DAFDTNKsIJs/8Ky9EoJJI7p98qKLIu2XNw/view#7

Design Phase of Token Engineering Process

The second stage of the Token Engineering Process is the Design Phase in which you make use of high-level descriptions from the previous step to come up with a specific design of the project. This will include everything that can be usually found in crypto whitepapers (e.g. governance mechanisms, incentive mechanisms, token supply, etc). After finishing the design, token engineers should represent the whole value flow and transactional logic on detailed visual diagrams. These diagrams will be a basis for creating mathematical models in the Deployment Phase. 

Token Engineering Artonomous Design Diagram
Artonomous design diagram, source: Artonomous GitHub

Objective Function

Every crypto project has some objective. The objective can consist of many goals, such as decentralization or token price. The objective function is a mathematical function assigning weights to different factors that influence the main objective in the order of their importance. This function will be a reference for machine learning algorithms in the next steps. They will try to find quantitative parameters (e.g. network fees) that maximize the output of this function.
Modified Metcalfe’s Law can serve as an inspiration during that step. It’s a framework for valuing crypto projects, but we believe that after adjustments it can also be used in this context.

Deployment Phase of Token Engineering Process

The Deployment Phase is final, but also the most demanding step in the process. It involves the implementation of machine learning algorithms that test our assumptions and optimize quantitative parameters. Token Engineering draws from Nassim Taleb’s concept of Antifragility and extensively uses feedback loops to make a system that gains from arising shocks.

Agent-based Modelling 

In agent-based modeling, we describe a set of behaviors and goals displayed by each agent participating in the system (this is why previous steps focused so much on describing stakeholders). Each agent is controlled by an autonomous AI and continuously optimizes his strategy. He learns from his experience and can mimic the behavior of other agents if he finds it effective (Reinforced Learning). This approach allows for mimicking real users, who adapt their strategies with time. An example adaptive agent would be a cryptocurrency trader, who changes his trading strategy in response to experiencing a loss of money.

Monte Carlo Simulations

Token Engineers use the Monte Carlo method to simulate the consequences of various possible interactions while taking into account the probability of their occurrence. By running a large number of simulations it’s possible to stress-test the project in multiple scenarios and identify emergent risks.

Testnet Deployment

If possible, it's highly beneficial for projects to extend the testing phase even further by letting real users use the network. Idea is the same as in agent-based testing - continuous optimization based on provided metrics. Furthermore, in case the project considers airdropping its tokens, giving them to early users is a great strategy. Even though part of the activity will be disingenuine and airdrop-oriented, such strategy still works better than most.

Time Duration

Token engineering process may take from as little as 2 weeks to as much as 5 months. It depends on the project category (Layer 1 protocol will require more time, than a simple DApp), and security requirements. For example, a bank issuing its digital token will have a very low risk tolerance.

Required Skills for Token Engineering

Token engineering is a multidisciplinary field and requires a great amount of specialized knowledge. Key knowledge areas are:

  • Systems Engineering
  • Machine Learning
  • Market Research
  • Capital Markets
  • Current trends in Web3
  • Blockchain Engineering
  • Statistics

Summary

The token engineering process consists of 3 steps: Discovery Phase, Design Phase, and Deployment Phase. It’s utilized mostly by established blockchain projects, and financial institutions like the International Monetary Fund. Even though it’s a very resource-consuming process, we believe it’s worth it. Projects that went through scrupulous design and testing before launch are much more likely to receive VC funding and be in the 10% of crypto projects that survive the bear market. Going through that process also has a symbolic meaning - it shows that the project is long-term oriented.

If you're looking to create a robust tokenomics model and go through institutional-grade testing please reach out to contact@nextrope.com. Our team is ready to help you with the token engineering process and ensure your project’s resilience in the long term.

FAQ

What does token engineering process look like?

  • Token engineering process is conducted in a 3-step methodical fashion. This includes Discovery Phase, Design Phase, and Deployment Phase. Each of these stages should be tailored to the specific needs of a project.

Is token engineering meant only for big projects?

  • We recommend that even small projects go through a simplified design and optimization process. This increases community's trust and makes sure that the tokenomics doesn't have any obvious flaws.

How long does the token engineering process take?

  • It depends on the project and may range from 2 weeks to 5 months.