Verify Plonk Proof

WHAT IT DOES

Verify Plonk Proof enables you to cryptographically verify PLONK (Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge) zero-knowledge proofs, a next-generation zk-SNARK proof system that improves upon Groth16 with a universal trusted setup and faster proof generation. PLONK is widely adopted in modern blockchain applications including zkEVM rollups, privacy-preserving smart contracts, and scalable verification systems. The tool takes a complete PLONK proof (A, B, C, Z, T1, T2, T3, W, W'), a verification key (alpha, beta, gamma, delta, K1-K4, sigma polynomials, and gate polynomials), and public inputs, and performs the full verification algorithm to confirm the proof's validity. If the verification succeeds, the tool returns a valid result, confirming that the proof demonstrates knowledge of inputs satisfying the circuit without revealing those inputs. This is essential for applications that require efficient and scalable verification of zero-knowledge proofs with universal setup.

HOW TO USE

Connect your wallet using the BGWallet connector (required for context). Select the proof format: "JSON" for structured proof data (recommended) or "Hex" for raw hex-encoded proof components. Enter the PLONK proof as a JSON object containing A, B, C, Z, T1, T2, T3, W, and W_ fields (or hex strings for the alternative format). Enter the verification key as a JSON object containing all required fields (alpha, beta, gamma, delta, K1-K4, sigma polynomials, and gate polynomials q_l, q_r, q_m, q_o, q_c). Enter the public inputs as a JSON array of field elements. Click "Verify Proof" to run the verification. The tool displays the proof format, the number of public inputs, and the verification result: a green "Verified" checkmark if the proof is valid and a red "Invalid" X if it fails. The result includes a detailed explanation of the outcome and the verification status.

TECHNICAL MECHANISM

This tool implements PLONK proof verification following the PLONK arithmetization scheme. The verification process uses polynomial commitments and pairing operations on the bn128 (BN254) elliptic curve. The PLONK verification algorithm checks the gate constraints, copy constraints, and quotient polynomial identity using the polynomial commitment scheme. Given the verification key containing the precomputed polynomials and the proof with polynomial commitments and evaluation proofs, the verifier: (1) computes the linearization polynomial using the public inputs and the proof elements; (2) verifies the grand product argument using the permutation polynomials; (3) checks the polynomial identity involving the quotient polynomial; and (4) verifies the opening proofs using the KZG polynomial commitment scheme. The verification involves multiple pairing checks, which are the most computationally intensive part of the process. The tool uses the bn128 curve for compatibility with Ethereum's pairing precompiles, enabling efficient on-chain verification. All computation is performed locally in the browser using cryptographic libraries, with no data sent to external servers.

WHAT IT CANNOT SEE

This tool cannot verify that the proof corresponds to actual on-chain state or values without additional context—you must ensure the public inputs match the expected on-chain data. It does not support all ZK proof systems (only PLONK). The tool cannot verify proofs without the circuit-specific verification key; both the proof and verification key are required for verification. It does not support hardware acceleration for verification; all computation is done in software in the browser. The tool cannot verify the correctness of the verification key without additional trust assumptions; you must trust the key generation ceremony. It does not support verification of proofs generated with non-standard curves beyond bn128. The tool cannot verify proofs for circuits with mutable or dynamic parameters; the verification key must match the circuit. It does not support proof aggregation or recursive verification; it only verifies a single proof. The tool cannot recover the original inputs from the proof; zero-knowledge proofs reveal only what they are designed to reveal. It does not support all PLONK variants or customized verification schemes beyond the standard PLONK implementation.

PLEASE NOTE

This tool is designed for developers and users working with PLONK zk-SNARKs, which are increasingly adopted in modern blockchain applications due to their universal setup and efficient proof generation. PLONK uses a universal trusted setup, meaning the same SRS can be used for any circuit of up to a certain size, unlike Groth16 which requires circuit-specific setups. The verification key contains the precomputed polynomials specific to the circuit being verified. The proof is structured with multiple polynomial commitments and opening proofs, which must be verified together. The tool uses the bn128 curve for compatibility with Ethereum's pairing precompiles, enabling efficient on-chain verification. Always verify proofs from trusted sources using a reliable verification library before relying on them in production systems. The verification result proves that the prover knew inputs satisfying the circuit, but it does not prove that those inputs correspond to real-world data without additional context. The tool supports standard PLONK verification, which is the most widely adopted PLONK variant in blockchain applications. For custom PLONK variants or specialized verification schemes, consider using a dedicated cryptographic library.