Blob.verify

1. Parse blob as polynomial coefficients (4096 field elements)
2. Evaluate polynomial at challenge point
3. Verify pairing equation: e(commitment, G2) = e(proof, challenge_G2)

import { Kzg } from 'tevm';

// Scenario: Received blob transaction from network
const receivedBlob = /* from network */;
const receivedCommitment = /* from transaction */;
const receivedProof = /* from transaction */;

// Verify without recomputing commitment (faster)
const isValid = Kzg.verify(receivedBlob, receivedCommitment, receivedProof);

if (!isValid) {
  throw new Error('Blob data does not match commitment');
}

// Can trust blob data matches what sender committed to

import { Kzg } from 'tevm';

const blobs = [blob1, blob2, blob3];
const commitments = blobs.map(b => Kzg.Commitment(b));
const proofs = blobs.map(b => Kzg.Proof(b));

// Single batch verification (faster than 3 individual verifications)
const allValid = Kzg.verifyBatch(blobs, commitments, proofs);

if (!allValid) {
  // Fallback: find which blob failed
  for (let i = 0; i < blobs.length; i++) {
    if (!Kzg.verify(blobs[i], commitments[i], proofs[i])) {
      console.error(`Blob ${i} failed verification`);
    }
  }
}

import { Kzg, Blob } from 'tevm';

const blob1 = Blob.fromData(data1);
const commitment1 = Kzg.Commitment(blob1);
const proof1 = Kzg.Proof(blob1);

const blob2 = Blob.fromData(data2); // Different data

// Proof for blob1 doesn't work with blob2
console.log(Kzg.verify(blob1, commitment1, proof1)); // true
console.log(Kzg.verify(blob2, commitment1, proof1)); // false

// Cannot forge proof
const fakeProof = new Uint8Array(48);
console.log(Kzg.verify(blob1, commitment1, fakeProof)); // false

import { Kzg, Blob } from 'tevm';

const blob = Blob.fromData(data);
const commitment = Kzg.Commitment(blob);
const proof = Kzg.Proof(blob);

// Always verifies for correctly generated proof
console.log(Kzg.verify(blob, commitment, proof)); // true (always)