{"uid":"cap_HQZ9TGfHA7zDiigDrqfTD","slug":"plonk-circuit-builder-mcp-e7c44526","name":"Plonk Circuit Builder MCP","description":"The premier global index of 1,069 monetized MCP nodes across 205 specialized subdomains. Gasless USDC runtime settlements via x402 V2 Spec on Base L2. Save 95% token context.","url":"https://api.m2mcent.com/plonk-circuit-builder-mcp/api/process?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":null,"responseSchema":{"type":"json","example":{"success":true}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.4","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.4/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.4","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.4","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_5R4mwoHhMiVlZOTU9W778","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.4","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Builds and processes PLONK zero-knowledge proof circuits from input data","exampleAgentPrompt":"Can you build me a PLONK zero-knowledge circuit for my constraint data: 'x * y = z where x and y are private inputs and z is public'?","exampleUseCases":[{"title":"Private input verification circuit","prompt":"Build me a PLONK circuit that proves I know two private numbers whose product equals a public value, without revealing the numbers themselves. Here's the circuit spec: 'private a, private b, public c: a * b == c'."},{"title":"zkRollup transaction proof","prompt":"I need a PLONK circuit compiled for my zkRollup — can you process this transaction validity constraint data: 'sender_balance >= tx_amount AND new_balance == sender_balance - tx_amount'?"},{"title":"Age credential zero-knowledge proof","prompt":"Generate a PLONK proof circuit for an age verification scheme — the data is 'private birth_year, public current_year, public min_age: current_year - birth_year >= min_age' so I can prove someone is old enough without revealing their exact age."}],"resultDescription":"Returns a compiled PLONK circuit artifact, which may include the constraint system, proving key, verification key, and any circuit-specific metadata needed to generate or verify zero-knowledge proofs.","failureModes":["Invalid or malformed circuit data string returns a parsing or validation error","Unsupported constraint types may cause compilation failure","Malformed JSON input results in 400-level error","Payment failure or insufficient USDC balance blocks the call via x402","Overly complex circuits may exceed processing limits or time out"],"whenToPreferThis":"Choose this endpoint when you need to programmatically build or compile PLONK-based zero-knowledge proof circuits as part of a cryptographic workflow, zkRollup pipeline, or privacy-preserving application. Prefer it over general ZK tooling when you need a hosted, pay-per-use PLONK circuit builder that integrates directly into an agentic workflow without local toolchain setup.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-12T12:50:54.326Z","isFirstParty":false,"canonicalSlug":"plonk-circuit-builder-mcp-e7c44526"}