{"uid":"cap_ozNGh40t-j6V4q74IRr4U","slug":"delx-commerce-gcd-greatest-common-divisor-api-2b72c852","name":"Delx Commerce GCD — Greatest Common Divisor API","description":"Pay-per-result APIs for agents. No signup. Exact price. Verifiable delivery. USDC on Base + Solana via x402.","url":"https://commerce.delx.ai/api/v1/x402/gcd?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"a":{"type":"integer","description":"First integer operand."},"b":{"type":"integer","description":"Second integer operand."}}},"responseSchema":{"type":"json","example":{"a":18,"b":24,"gcd":6,"schema":"delx/gcd/v1"}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.001","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.001/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_zs2NSoy9SJmCOxakShz9_","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.001","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes the greatest common divisor (GCD) of two integers, paid per-result via USDC on Base or Solana using x402.","exampleAgentPrompt":"What is the greatest common divisor of 48 and 180?","exampleUseCases":[{"title":"Fraction simplification in math tutor","prompt":"Simplify the fraction 36 over 48 — can you find the GCD of 36 and 48 so I can reduce it to lowest terms?"},{"title":"Cryptography key parameter check","prompt":"I need to verify my two RSA key candidates are coprime — what's the GCD of 65537 and 10403?"},{"title":"Scheduling LCM computation step","prompt":"To find the least common multiple of 12 and 18, I first need the GCD of 12 and 18 — can you compute that?"}],"resultDescription":"Returns a JSON object containing both input integers (a and b), the computed GCD value, and a schema identifier string ('delx/gcd/v1') confirming the response format.","failureModes":["Missing or non-integer input for a or b returns an error","Division by zero edge case if either operand is zero may return 0 or an error","Network or payment failure via x402 protocol can prevent result delivery","Malformed request body returns a 400-level error"],"whenToPreferThis":"Choose this endpoint when you need a verifiable, pay-per-use GCD computation with no signup friction, especially in agent pipelines that already use x402 micropayment infrastructure on Base or Solana. Prefer it over implementing Euclidean algorithm locally when auditability or payment receipts matter.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-01T00:54:06.681Z","isFirstParty":false,"canonicalSlug":"delx-commerce-gcd-greatest-common-divisor-api-2b72c852"}