Urgent.News

What's breaking now, across thousands of outlets.

Tech

What Is a Zero-Knowledge Proof, in Plain Language

Imagine proving that you know a secret password without ever saying the password out loud. That sounds impossible. It is also the whole idea behind a zero-knowledge proof. A zero-knowledge proof lets one side prove that a statement is true without revealing the details behind it. That is the definition the zkVerify Agent Games Creator Track itself gives for this topic, and it is the definition…

Zero-knowledge proofs are a fascinating mathematical concept that enables one party to prove the truth of a statement without revealing any additional information. Imagine a scenario where you need to demonstrate that you possess a secret password without actually disclosing the password itself. This is precisely the essence of a zero-knowledge proof. The proof allows the prover to convince the verifier of the statement's validity while maintaining the secrecy of the underlying details.

In a zero-knowledge proof, there are two primary roles: the prover and the verifier. The prover is the entity making a claim, while the verifier is the party responsible for validating the claim. The prover aims to persuade the verifier, and the verifier seeks assurance without gaining any additional knowledge. To illustrate this concept, consider a sealed envelope containing a secret number.

You write the number on a piece of paper, seal it in the envelope, and present it to a friend. The friend cannot access the number, but if a trusted third party later opens the envelope and confirms that the number matches your claim, the friend gains confidence in your honesty, without ever learning the actual number.

The functionality of a zero-knowledge proof relies on three fundamental properties: completeness, soundness, and zero-knowledge. First, completeness ensures that if the statement being proven is true, and the prover acts honestly, the verifier will accept the proof. An honest prover will never fail to satisfy this condition. Second, soundness guarantees that if the statement is false, no devious party can fabricate a convincing proof that passes the verifier's check.

The verifier should only accept true statements, with a negligible chance of error. Lastly, zero-knowledge emphasizes that the verifier should learn nothing beyond the fact that the statement is indeed true. No secret information or additional details should be inadvertently disclosed during the process.

A zero-knowledge proof consists of two crucial components: proof generation and proof verification. Proof generation involves computationally intensive operations that create the proof itself. This phase takes the secret input, processes it through the proving system, and generates a compact proof object that can be verified by anyone.

Proof verification, on the other hand, is the actual check performed by the verifier. The verifier receives the proof and the publicly available information, runs the verification algorithm, and obtains a binary result—either "yes" or "no." If the proof was generated correctly, the verification will yield a positive outcome. Conversely, if any fraudulent attempt was made, the verification will fail to accept the proof.

While the concept of zero-knowledge proofs is intriguing, implementing them on popular blockchain platforms can be costly. Verifying a single zero-knowledge proof on Ethereum, for example, can consume a significant amount of gas units, ranging from 200,000 to 300,000, depending on the proof type. During periods of network congestion, when gas prices surge, verifying a single proof can even cost between 20 and 60 dollars, or more.

The market implications are substantial, with an estimated security expense of over 100 million dollars for zkRollups in 2024, and potentially soaring to 1.5 billion dollars by 2028, factoring in ZK applications.

To address this challenge, zkVerify was established as a public and decentralized blockchain specifically dedicated to zero-knowledge proof verification. It accepts proofs, verifies them, and records both the proof and its subsequent verification on the blockchain for future reference. By sending proofs to a dedicated verification chain, applications can circumvent the high gas costs associated with proof verification on Ethereum.

Furthermore, zkVerify also solves another problem by enabling the direct verification of STARK proofs, eliminating the need for expensive conversions to Groth16 proofs.

In practice, zkVerify can be observed through the zkVerify Agent Games, where agents compete by submitting proofs in structured decision-making tasks. Each agent's proof load-bearing nature is determined by a scoring system. A correct decision accompanied by a verified proof earns 12 points, while a correct decision without a valid proof incurs a penalty of 2 points.

Failure to deliver a proof within the 60-second deadline results in a 2-point deduction. By leveraging zkVerify's dedicated verification chain, agents can efficiently generate proofs within seconds, ensuring timely and cost-effective participation in the zkVerify Agent Games.

Written by urgent.news from Dev.to's reporting — not their text. Machine-written — may contain errors; check the original before relying on it.

Read the original at dev.to →

More in Tech

How to chart weekly federal tax refund data

A federal tax refund report ending May 8, 2026 lists 99,138,000 refunds. That's a total from the start of the filing season through the report's cutoff.

  • 99,138,000 federal tax refunds filed by May 8, 2026
  • Comparison of May 8, 2026, with May 9, 2025
  • Use cumulative refunds and change between reports in chart

I sorted 77 daily browser games into 9 categories. Here is what the data says

Daily puzzle games did not stop at Wordle. While building a small index of them, I ended up with a dataset of 77 free daily browser games, and a few numbers surprised me.

  • 77 free daily browser games categorized into nine groups
  • Word games make up less than a third of the total 77 games
  • Top contributors are The New York Times, LinkedIn, and Teuteuf

More from Friday 20 November →