{"uid":"cap_ZVs87QqIZZ5fVRxUHPqh-","slug":"numora-constraint-solver-api-17060006","name":"Numora Constraint Solver API","description":"100 pure math computation endpoints for AI agents. Statistics, financial math, linear algebra, equation solving, calculus, number theory, sequence generation, and unit conversions. Zero external dependencies. x402 micropayments on Base.","url":"https://numomo.vercel.app/api/solve/constraint","method":"POST","headers":{},"bodySchema":{"type":"object","required":["variables","constraints"],"properties":{"variables":{"type":"object"},"constraints":{"type":"array"}}},"responseSchema":{"type":"object","required":["success","result","computation"],"properties":{"result":{"type":"object","description":"Computation result varies by endpoint"},"success":{"type":"boolean","description":"Always true on success"},"computation":{"type":"string","description":"Human-readable description of what was computed"}}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.1","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.1/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_kKtwIgbMnnKtQ19qb9yEG","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.1","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Solves systems of constraints over named variables and returns feasible solutions or optimal values","exampleAgentPrompt":"Solve for variables x, y, and z given the constraints x + y + z = 100, x >= 10, y >= 20, z >= 5, and x <= 50 — I need a feasible assignment that satisfies all of them.","exampleUseCases":[{"title":"Resource budget allocation","prompt":"I have three budget categories A, B, and C that must sum to $500,000. A must be at least $100,000, B between $50,000 and $200,000, and C at most $150,000. Find me values for A, B, and C that satisfy all those constraints."},{"title":"Diet or nutrition planning","prompt":"I need to find quantities of food items protein_g, carbs_g, and fat_g such that total calories equal 2000, protein is at least 150g, carbs are between 100 and 250g, and fat is no more than 80g. Can you solve for valid amounts?"},{"title":"Workforce scheduling feasibility","prompt":"Given variables for day_shift_workers and night_shift_workers, check if it's feasible to satisfy: total workers equals 50, day shift is at least 30, night shift is at least 15, and day shift plus night shift cannot exceed 50."}],"resultDescription":"Returns a JSON object with a boolean success flag, a result object containing the solved variable values or feasibility determination, and a human-readable computation string describing what was computed and how the constraints were resolved.","failureModes":["Infeasible system — constraints are contradictory and no solution exists","Missing required fields — variables or constraints array not provided","Malformed constraint expressions — unparseable syntax in constraint strings","Underdetermined system — too few constraints to produce a unique solution","Payment failure — x402 micropayment not completed or insufficient USDC balance","Timeout — overly complex constraint systems may exceed compute limits"],"whenToPreferThis":"Choose this endpoint when you need to find variable assignments that satisfy a set of mathematical constraints without relying on any external data sources or services. It is ideal for constraint satisfaction problems, feasibility checks, and bounded optimization where all logic is purely mathematical. Prefer it over general-purpose LLM reasoning for constraint problems because it returns exact, verifiable numeric solutions. It is well-suited for budget allocation, scheduling feasibility, resource planning, and any scenario where you have named variables and a list of inequality or equality constraints.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-13T18:52:58.172Z","isFirstParty":false}