{"id":"integer-gcd","version":"1.0.0","description":"Compute the non-negative greatest common divisor of two canonical integer strings.","supported_operations":["integer gcd","greatest common divisor of two integers","gcd of integers"],"unsupported_operations":["least common multiple","gcd of more than two integers","floating-point gcd","polynomial gcd"],"semantics":["Inputs are canonical integer strings: 0 or an optional ASCII minus followed by a non-zero leading digit.","The input -0 is accepted and canonicalized to 0 before evaluation.","Integers are parsed with BigInt. A plus sign, spaces, underscores, hex, scientific notation, empty strings, and leading zeros other than 0 are rejected.","Each input may have at most 1000 digits excluding the sign.","The result is the non-negative greatest common divisor as a canonical integer string.","gcd(0, n) and gcd(n, 0) equal |n|. gcd(0, 0) is rejected as undefined."],"limits":{"max_digits":1000},"pricing":{"status":"unpriced","charge_usd":null},"input_schema":{"type":"object","additionalProperties":false,"required":["a","b"],"properties":{"a":{"type":"string","minLength":1,"maxLength":1001},"b":{"type":"string","minLength":1,"maxLength":1001}}},"output_schema":{"type":"object","additionalProperties":false,"required":["value"],"properties":{"value":{"type":"string","minLength":1,"maxLength":1000}}},"examples":[{"input":{"a":"48","b":"18"},"output":{"value":"6"}}],"execute_url":"/v1/tools/integer-gcd/versions/1.0.0/execute"}