{"uid":"cap_ELd-r4aY4Am2yZ33K5aBO","slug":"bracketed-polynomial-root-finder-76b7d881","name":"Bracketed Polynomial Root Finder","description":"Get a checked rational bracket for a degree 1-8 polynomial root. Bisect a sign-changing rational bracket for at most 64 iterations; return a certified bracket or exact rational root. No arbitrary code, all-roots or uniqueness claim.","url":"https://www.mahastrategies.com/api/v1/micro/bracketed-polynomial-root","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","required":["dataClass","coefficientsAscending","lower","upper","tolerance","maxIterations"],"properties":{"lower":{"type":"string","maxLength":21},"upper":{"type":"string","maxLength":21},"dataClass":{"enum":["public","synthetic"],"type":"string"},"tolerance":{"type":"string","maxLength":21},"maxIterations":{"type":"integer","maximum":64,"minimum":1},"coefficientsAscending":{"type":"array","maxItems":9,"minItems":1}},"additionalProperties":false},"type":{"type":"string","const":"http"},"method":{"enum":["POST"],"type":"string"},"bodyType":{"enum":["json","form-data","text"],"type":"string"}},"additionalProperties":false},"output":{"type":"object","required":["type"],"properties":{"type":{"type":"string"},"example":{"type":"object","required":["version","offerId","amountBaseUnits","inputDigest","result","boundaries","receiptDigest"],"properties":{"result":{"type":"object"},"offerId":{"enum":["bracketed-polynomial-root"],"type":"string"},"version":{"enum":["maha-microproducts/0.1"],"type":"string"},"boundaries":{"type":"array","maxItems":128,"minItems":0},"inputDigest":{"type":"string","maxLength":71},"receiptDigest":{"type":"string","maxLength":71},"amountBaseUnits":{"enum":["9000"],"type":"string"}},"additionalProperties":false}}}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.009","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","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.009/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.009","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.009","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_TUwZstpA6Y1VwIhecYc6D","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.009","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Bisects a sign-changing rational bracket for a polynomial of degree 1–8 to certify a root bracket or exact rational root within up to 64 iterations.","exampleAgentPrompt":"Find a certified root of the polynomial 1 + 0x - 6x² + x³ (coefficients ascending: [1, 0, -6, 1]) between lower bound -3 and upper bound -2, with tolerance 1e-9 and at most 64 iterations, using public data.","exampleUseCases":[{"title":"Certify cubic polynomial zero","prompt":"I have the cubic polynomial with ascending coefficients [-2, 0, 1, 1] and I know there's a sign change between x = 0 and x = 2. Can you bisect it with a tolerance of 1e-10 and up to 50 iterations to give me a certified root bracket?"},{"title":"Isolate quadratic root interval","prompt":"For the quadratic polynomial with coefficients [6, -5, 1] (ascending), find a certified bracket or exact rational root between lower bound 2 and upper bound 4, tolerance 1e-8, max 32 iterations."},{"title":"Numerical root for engineering model","prompt":"I need to verify the zero-crossing of a degree-5 polynomial with ascending coefficients [-1, 3, -2, 0, 1, -1] that I know falls between 0.5 and 1.5. Please run up to 64 bisection iterations with a tolerance of 0.000001 and return a certified bracket."}],"resultDescription":"Returns a JSON object containing the certified bracket or exact rational root, the offer ID, version string, input and receipt digests, amount in base units, and an array of boundary points accumulated during bisection — providing an auditable, certified numerical result.","failureModes":["No sign change detected between lower and upper bounds — bisection cannot proceed","Polynomial degree exceeds 8 (more than 9 coefficients) — rejected","Max iterations exceeds 64 — rejected by schema validation","Tolerance or bound values malformed or too long (>21 chars) — schema rejection","Lower bound equals upper bound — degenerate bracket","Payment failure via x402 protocol — call not executed"],"whenToPreferThis":"Choose this endpoint when you need a numerically certified, audit-traceable root bracket for a univariate polynomial of degree 1–8, and you have a known sign-changing interval. It is ideal for deterministic, reproducible numerical results with rational arithmetic guarantees — not for finding all roots, roots of higher-degree polynomials, or complex roots. Prefer it over general-purpose computer algebra systems when certified bracketing and receipt-level auditability matter.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T06:44:21.820Z","isFirstParty":false}