{"uid":"cap_NLC5Lv8pXdTk1o6Ib5b9w","slug":"gcd-calculator-greatest-common-divisor-90309902","name":"GCD Calculator (Greatest Common Divisor)","description":"Compute the GCD of two integers.","url":"https://sovereign-x402-zeta.vercel.app/api/v1/sequence/gcd?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","$schema":"https://json-schema.org/draft/2020-12/schema","required":["input"],"properties":{"input":{"type":"object","required":["type","method","bodyType","body"],"properties":{"body":{"type":"object","properties":{},"additionalProperties":true},"type":{"type":"string","const":"http"},"method":{"enum":["POST","PUT","PATCH"],"type":"string"},"bodyType":{"enum":["json","form-data","text"],"type":"string"}},"additionalProperties":false},"output":{"type":"object","required":["type"],"properties":{"type":{"type":"string"},"example":{"type":"object"}}}}},"responseSchema":null,"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_IOQyMt6ju92jSKy043bah","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 via a paid API endpoint.","exampleAgentPrompt":"What is the greatest common divisor of 252 and 105?","exampleUseCases":[{"title":"Simplify a fraction automatically","prompt":"I need to reduce the fraction 144/960 to its simplest form — can you find the GCD of 144 and 960 so I can divide both by it?"},{"title":"Check divisibility in a math pipeline","prompt":"In my number crunching workflow, what's the GCD of 1071 and 462? I need it to figure out whether these two values share a common factor."},{"title":"Validate coprime pairs for cryptography","prompt":"Are 35 and 64 coprime? Compute their GCD — if it's 1, they're coprime and I can use them in my RSA key generation logic."}],"resultDescription":"Returns an integer representing the greatest common divisor of the two input integers. For example, GCD(48, 18) returns 6.","failureModes":["Missing or malformed input integers cause a 400/422 validation error","Non-integer inputs (e.g. floats or strings) may be rejected","Payment failure or insufficient USDC balance returns a 402 Payment Required error","Both inputs being zero is mathematically undefined and may return an error or zero","Network timeouts on the Vercel edge function"],"whenToPreferThis":"Use this endpoint when you need a quick, on-demand GCD computation as part of an automated agent workflow that already handles x402 micropayments. Prefer this over implementing GCD logic yourself when you want a stateless, pre-built math microservice. Ideal for workflows involving fraction simplification, cryptographic checks (coprime detection), or any number-theory pipeline that needs GCD without spinning up compute.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-13T00:35:30.972Z","isFirstParty":false,"canonicalSlug":"gcd-calculator-greatest-common-divisor-90309902"}