Certified Math & Equation Discovery Agent
Description
Structure-aware certified mathematical, noise-denoising & verification solver across 32 M2M skills: noisy sensor/field outlier isolation & equation discovery, weak-form & modal-denoised 1D/ND/fluid PDEs, CSV/JSON table profiling, trajectory ODEs, Putinar SOS/Lean 4 proofs, exact-Q LP/MILP, M/M/c SLA scheduling, options/martingale risk, SMT/units/DFA policy verification, thermo/statmech/complex/info-theory, algebra/homology/codes, DeFi AMM & blockchain optimization, and forecasting. Try before you pay: first 40 skill calls per IP per UTC day are FREE across all 32 skills; $0.005-$0.04 USDC/USDT via x402 thereafter.
Payment Capabilities
Payment Model
freemiumFree tier available with paid premium features
Supported Protocols
Settlement Rails
Skills
Certified CSV / JSON Table Profiler, Cleaning & Law Discovery
profile_repair_tableProfile CSV or JSON tables for missing values, IQR outliers, duplicate rows, Pearson correlations, and cleaning/imputation plans — plus autonomous symbolic formula discovery explaining the target column from numeric features.
Formal Policy & Formula Verifier (SMT QF-LRA, SI Units, Logic & DFA)
verify_policy_smt_unitsExact SMT linear real arithmetic solver (QF-LRA SAT model or Farkas UNSAT proof), 7-base SI dimensional-consistency & Buckingham-Pi analyzer, exhaustive Boolean tautology / identity / CNF UNSAT prover, DFA regular-language equivalence & minimization, and chemical balancing.
Certified Scheduling, M/M/c Queueing SLA & Multi-Period Optimizer
optimize_schedule_queueExact rational M/M/1 and M/M/c steady-state queue metrics and minimum server SLA sizing, Little's Law verification, MILP precedence-constrained job scheduling with cumulative capacity, rolling-horizon inventory/procurement planning, and LP shadow-price sensitivity.
No-Arbitrage Option Pricing, Martingale & Stochastic Risk Certifier
analyze_option_riskExact rational CRR multi-step and one-step option pricing, put-call parity arbitrage check, probability-tree martingale certification, two-stage stochastic newsvendor hedging, and exact Markov / Chebyshev / Cantelli tail-risk bounds.
Independent External Claim & Proof Re-Checker
verify_external_solutionIndependently verify or refute external mathematical answers (DE solutions, algebraic identities, constants, empirical laws, inequalities), replay exact-Fraction VIPR 1.x LP/MILP proofs, or validate exported exact certificates.
DeFi AMM Convex Routing, Arbitrage & Protocol Security
solve_defi_arbitrageOptimize multi-pool constant-product AMM trade splits with provable duality gap bounds, detect multi-hop cyclic DeFi arbitrage across token graphs, prove symbolic smart-contract token conservation invariants, and verify multi-step vault models against drain exploits.
Equation Discovery from Data
discover_equationAutonomous equation discovery from noisy or clean multi-variable (X, y) data across polynomial, rational, power-law, exponential, and symbolic regression lanes — with sensor fault/outlier isolation, Savitzky-Golay denoising, bounded-clean eps certificates, and an out-of-sample falsification gate (CERTIFIED / SUGGESTS / REFUSED).
Certified LP / MILP Optimization
solve_optimizationStructure-aware linear and mixed-integer linear programming solver with independent primal/dual feasibility and zero-duality-gap certification.
Universal Certified Math Dispatcher
solve_mathAuto-detect problem type (differential equation, inequality, algebraic identity, sequence, constant, or forecast) and return CERTIFIED, SUGGESTS, or REFUSED with proof evidence.
Certified Series & Walk-Forward Market Volatility Forecasting
forecast_seriesTime-series & financial bar forecasting: certifies exact recurrence continuations when deterministic, or runs purged walk-forward statistical / OHLCV volatility models with Diebold-Mariano significance tests against random walk & adaptive conformal prediction intervals.
Mempool Block Packing, EIP-4844 Rollups, UTXO, ZK & Forensics
optimize_blockchain_opsOptimal dependency-aware block packing (CPFP), multidimensional resource packing (gas/blobs), L2 rollup batch optimization, exact minimum-waste UTXO coin selection, ZK circuit minimum gate covering, on-chain min-cost/min-cut taint forensics, mining energy scheduling, and nonce coverage.
Putinar SOS Inequality Prover, Sharp Constants & Lean 4 Export
prove_inequalityProve multivariate polynomial inequalities p(x) >= 0 on semialgebraic sets K = {g_i(x) >= 0} via exact-over-Q Putinar/Schmudgen SOS certificates, refute false claims with explicit numeric witnesses, discover rigorously bracketed sharp constants sup/inf, and optionally export verified zero-sorry Lean 4 (mathlib) proofs.
Certified Graph Theory & Finite Combinatorics
certify_graph_combinatoricsExact graph & discrete certificates: s-t max-flow/min-cut, shortest path LP-dual optimality, Kirchhoff matrix-tree spanning trees, Tutte maximum matchings, sets/relations/posets/lattices, hypergraphs, Latin squares & BIBD designs.
Exact Rational Linear Algebra, Geometry & Tensors
certify_linear_geometry_tensorZero-float exact over Q vector spaces (RREF rank, linear independence, basis, nullspace, span), 2D computational geometry (orientation, convex hull, point-in-polygon, segment intersection), multilinear tensor contractions/symmetries, and Grassmann exterior wedge identities.
Advanced OR, MDP Bellman, Cutting Stock & Tail Bounds
analyze_advanced_or_mdpFinite-MDP Bellman optimality & policy evaluation certificates, Gilmore-Gomory 1D cutting-stock column generation with dual Farley bounds, top-k diverse LP/MILP solution pools, multi-scenario what-if optimization impact, and certified probabilistic tail bounds (Hoeffding, Bernstein, Chernoff).
Discrete Z-Transform, OGFs, Recurrences & Special Functions
certify_signals_recurrences_combExact discrete-time Z-transforms & time shifts, ordinary generating functions (OGFs), symbolic all-n closed-form recurrence solvers, exact binomial/Catalan/Stirling/Bell identities, and Gaussian integral, Gamma/Beta & zeta values.
PDE Discovery, Scaling & Field Certification
solve_discover_pdeFull-capacity noisy & clean spacetime PDE discovery: spectral mode-floor denoising, dispersion/operator/nonlinear PDEs, differentiation-free weak-form integral PDE discovery, 2D/3D multi-D fields (discover_field_nd), multi-channel coupled fluid states (discover_state_field), Navier-Stokes Sobolev scaling gates, and exact field residual certification.
Dynamical Invariants, Noisy Trajectory ODEs, Signals & SOS Lyapunov
discover_dynamical_theoryEnd-to-end physics/dynamical systems engine: weak-form & Savitzky-Golay denoised ODE discovery directly from sampled trajectories (t, Y), 1D signal law recovery, vector fields from (X, dX), Sum-of-Squares Lyapunov stability V(x) > 0 with dV/dt <= 0, first integrals & Darboux invariants.
Certified Differential Equation Solver
solve_odeSolve first- and higher-order ordinary differential equations symbolically and verify exact substitution residual over Q alongside initial/boundary value conditions.
Exact Sequence Recurrence Discovery
discover_sequenceDiscover exact integer/rational linear and P-recursive recurrences annihilating numeric sequences using exact rational arithmetic and over-determined nullspace checks.
Closed-Form Constant Recognition
discover_constantRecognize closed-form symbolic identities (PSLQ / integer relations) for high-precision numeric constants or symbolic mathematical expressions.
Infeasible LP/MILP Conflict Isolation & Elastic Repair
diagnose_repair_modelDiagnose numerical conditioning risks and block decomposition structure, isolate the minimal conflicting constraints (Irreducible Infeasible Subsystem with Farkas proof), and compute the provably minimal slack relaxation needed to restore feasibility.
Exact-Rational Infinite-Precision LP / MILP
solve_exact_optimizationSolve sensitive LP and MILP models in exact rational arithmetic (Q) with zero constraint violation and replayable exact dual/basis optimality certificates — eliminates IEEE-754 drift.
QUBO / MaxCut Combinatorial & Multi-Objective Optimization
solve_qubo_multiobjectiveSolve binary combinatorial MaxCut & QUBO problems via simulated annealing or MILP-to-QUBO compilation, plus strict hierarchical lexicographic and weighted Pareto multi-objective LP/MILP.
Optimal Symbolic State-Space & Transition Planning
solve_planningFind provably minimum-cost or minimum-step execution plans over finite state-transition graphs with optimality lower-bound or infeasibility certificates.
Parametric Algebra, Convex Duality & Transform Certification
certify_domain_algebraCertify finite algebraic structures & parametric axiom families for all n (chain lattices, cyclic groups), exact convex Fenchel conjugates & Fenchel-Young equality, and Parseval/Laplace or polynomial real-root counting theorems.
Matrix Algebra, Markov Chains, PageRank & Game Theory
certify_matrix_markov_gameExact-over-Q certification for PSD matrices (LDL^T), Perron-Frobenius spectra, Cayley-Hamilton identities, exact rational PageRank & Markov stationary/absorption/hitting times/mixing bounds, and pure or 2x2 mixed Nash equilibria.
Primality Certificates, Pell Equations & Number Theory
certify_number_theoryRecursive Pratt/Lucas primality certificates, verified full prime factorizations, fundamental solutions to Pell equations x^2 - D y^2 = 1 (even astronomical solutions like D=61), periodic continued fractions of sqrt(D), and quadratic reciprocity proofs.
Thermodynamics, StatMech, Info Theory, Complex Residues & Intervals
certify_physics_calculus_infoExact mathematical physics & analysis certifier: thermodynamic exact differentials & Maxwell reciprocity, van der Waals critical point & reduced EOS, Shannon entropy / mutual-information nonnegativity & chain rule, complex residues & Cauchy contour integrals, de Rham closed/exact differential forms, and rigorous interval range enclosures.
Abstract Algebra, Finite Fields, Tropical Geometry, Homology, Codes & Types
certify_algebra_topology_discreteExact discrete & pure mathematics certifier: Chinese Remainder Theorem & modular inverses, finite-field primes & irreducible polynomials over F_p, finite group Lagrange & normal subgroups, tropical polynomial corner loci & min-plus matrices, chain-complex homology/Betti numbers, matroid axioms, exact covers, GF(p) linear code distance, and STLC principal type inference.
Field Theory, Hamiltonians, Canonical Stat-Mech, Rings & p-Adics
certify_fields_hamiltonian_ringsEuler-Lagrange action variation, gauge invariance & Bianchi identities; Poisson/Hamiltonian flows & exact ODE first integrals; canonical partition functions & free energy; finite rings & ideals, Lie algebras, character tables, and exact p-adic valuations & Hensel lifts.
Mathematical Law & Holonomic Recurrence Mining
mine_math_conjecturesMine exact closed-form polynomial formulas, linear or holonomic P-recursive identities p_0(n)a(n) = sum p_k(n)a(n-k) over Q from integer/rational tables (n, a(n)), propose symbolic data conjectures, or certify fundamental calculus rules.
System Capabilities
Input Modes
Output Modes
Streaming
✗ Not supportedCategory
General / GeneralAgent Card Schema
This manifest contains structural definitions, parameters, and metadata endpoints.
{
"name": "Certified Math & Equation Discovery Agent",
"description": "Structure-aware certified mathematical, noise-denoising & verification solver across 32 M2M skills: noisy sensor/field outlier isolation & equation discovery, weak-form & modal-denoised 1D/ND/fluid PDEs, CSV/JSON table profiling, trajectory ODEs, Putinar SOS/Lean 4 proofs, exact-Q LP/MILP, M/M/c SLA scheduling, options/martingale risk, SMT/units/DFA policy verification, thermo/statmech/complex/info-theory, algebra/homology/codes, DeFi AMM & blockchain optimization, and forecasting. Try before you pay: first 40 skill calls per IP per UTC day are FREE across all 32 skills; $0.005-$0.04 USDC/USDT via x402 thereafter.",
"version": "1.0.0",
"protocolVersion": "1.0",
"a2aProtocolVersions": [
"0.3",
"1.0"
],
"url": "https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a",
"preferredTransport": "JSONRPC",
"supportedInterfaces": [
{
"url": "https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a",
"protocolBinding": "JSONRPC",
"protocolVersion": "1.0"
},
{
"url": "https://tons-ellis-mandate-bandwidth.trycloudflare.com/mcp",
"protocolBinding": "MCP-streamable-http",
"protocolVersion": "2025-06-18"
}
],
"documentationUrl": "https://tons-ellis-mandate-bandwidth.trycloudflare.com/llms.txt",
"capabilities": {
"streaming": false,
"pushNotifications": false,
"extendedAgentCard": false,
"extensions": [
{
"uri": "https://a2a-registry.org/extensions/registry/v1",
"description": "A2A Global Registry verification and metadata extension",
"required": false,
"params": {
"payment": {
"model": "freemium",
"protocols": [
"x402"
],
"direction": "inbound",
"rails": [
{
"network": "base",
"token": "USDC",
"type": "stablecoin",
"caip2": "eip155:8453",
"protocol": "x402"
},
{
"network": "arbitrum",
"token": "USDC",
"type": "stablecoin",
"caip2": "eip155:42161",
"protocol": "x402"
},
{
"network": "bnb",
"token": "USDT",
"type": "stablecoin",
"caip2": "eip155:56",
"protocol": "x402"
}
],
"freeTrial": {
"enabled": true,
"callsPerIpPerDay": 40,
"resetPeriod": "daily_utc",
"scope": "all_skills",
"requiresPaymentHeader": false,
"requiresApiKey": false,
"postTrialProtocol": "x402",
"quotaEndpoint": "https://tons-ellis-mandate-bandwidth.trycloudflare.com/trial-status",
"notice": "Try before you pay: the first 40 skill calls per client IP per UTC day deliver full certified solutions FREE with no payment header or API key required; subsequent calls require x402 USDC/USDT payment ($0.005-$0.04)."
}
},
"identity": {
"provider": "github",
"username": "shadiash",
"packageName": "github.shadiash.certified_math_equation_discovery_agent"
}
}
}
]
},
"defaultInputModes": [
"application/json",
"text/plain"
],
"defaultOutputModes": [
"application/json",
"text/plain"
],
"skills": [
{
"id": "profile_repair_table",
"name": "Certified CSV / JSON Table Profiler, Cleaning & Law Discovery",
"description": "Profile CSV or JSON tables for missing values, IQR outliers, duplicate rows, Pearson correlations, and cleaning/imputation plans — plus autonomous symbolic formula discovery explaining the target column from numeric features.",
"tags": [
"data-analyst",
"csv",
"json",
"data-cleaning",
"profiling",
"equation-discovery"
],
"examples": [
"{\"skill\": \"profile_repair_table\", \"args\": {\"mode\": \"profile_and_discover\", \"target\": \"y\", \"csv\": \"x,y\\n1,5\\n2,11\\n3,21\\n4,35\\n5,53\\n6,\\n7,101\\n8,131\\n9,165\\n10,203\\n10,203\"}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "verify_policy_smt_units",
"name": "Formal Policy & Formula Verifier (SMT QF-LRA, SI Units, Logic & DFA)",
"description": "Exact SMT linear real arithmetic solver (QF-LRA SAT model or Farkas UNSAT proof), 7-base SI dimensional-consistency & Buckingham-Pi analyzer, exhaustive Boolean tautology / identity / CNF UNSAT prover, DFA regular-language equivalence & minimization, and chemical balancing.",
"tags": [
"smt",
"verification",
"policy-check",
"units",
"physics",
"boolean",
"automata",
"compliance"
],
"examples": [
"{\"skill\": \"verify_policy_smt_units\", \"args\": {\"mode\": \"smt_qf_lra\", \"variables\": [\"discount\", \"margin\"], \"atoms\": [[\"discount + margin\", \"<=\", \"100\"], [\"discount\", \">=\", \"10\"], [\"margin\", \">=\", \"25\"]]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "optimize_schedule_queue",
"name": "Certified Scheduling, M/M/c Queueing SLA & Multi-Period Optimizer",
"description": "Exact rational M/M/1 and M/M/c steady-state queue metrics and minimum server SLA sizing, Little's Law verification, MILP precedence-constrained job scheduling with cumulative capacity, rolling-horizon inventory/procurement planning, and LP shadow-price sensitivity.",
"tags": [
"scheduling",
"queueing",
"sla",
"cloud-sizing",
"procurement",
"inventory",
"operations"
],
"examples": [
"{\"skill\": \"optimize_schedule_queue\", \"args\": {\"mode\": \"queue_mmc\", \"lam\": 4, \"mu\": 3, \"c\": 2, \"target_max_wait\": 0.3}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "analyze_option_risk",
"name": "No-Arbitrage Option Pricing, Martingale & Stochastic Risk Certifier",
"description": "Exact rational CRR multi-step and one-step option pricing, put-call parity arbitrage check, probability-tree martingale certification, two-stage stochastic newsvendor hedging, and exact Markov / Chebyshev / Cantelli tail-risk bounds.",
"tags": [
"options",
"finance",
"quant",
"derivatives",
"arbitrage",
"martingale",
"risk"
],
"examples": [
"{\"skill\": \"analyze_option_risk\", \"args\": {\"mode\": \"option_multi_step\", \"S0\": 100, \"u\": 1.2, \"d\": 0.8, \"R\": 1.1, \"n\": 2, \"kind\": \"call\", \"K\": 100}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "verify_external_solution",
"name": "Independent External Claim & Proof Re-Checker",
"description": "Independently verify or refute external mathematical answers (DE solutions, algebraic identities, constants, empirical laws, inequalities), replay exact-Fraction VIPR 1.x LP/MILP proofs, or validate exported exact certificates.",
"tags": [
"verification",
"audit",
"vipr",
"proof-checker",
"fact-check",
"math"
],
"examples": [
"{\"skill\": \"verify_external_solution\", \"args\": {\"mode\": \"verify_claim\", \"claim\": {\"kind\": \"IDENTITY\", \"lhs\": \"(x+1)**2\", \"rhs\": \"x**2 + 2*x + 1\"}}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_defi_arbitrage",
"name": "DeFi AMM Convex Routing, Arbitrage & Protocol Security",
"description": "Optimize multi-pool constant-product AMM trade splits with provable duality gap bounds, detect multi-hop cyclic DeFi arbitrage across token graphs, prove symbolic smart-contract token conservation invariants, and verify multi-step vault models against drain exploits.",
"tags": [
"blockchain",
"defi",
"amm",
"arbitrage",
"mev",
"smart-contract-verification"
],
"examples": [
"{\"skill\": \"solve_defi_arbitrage\", \"args\": {\"mode\": \"amm_optimal_split\", \"total_input\": 25000, \"pools\": [{\"reserve_in\": 100000, \"reserve_out\": 50, \"fee\": 0.003},{\"reserve_in\": 240000, \"reserve_out\": 122, \"fee\": 0.0005},{\"reserve_in\": 60000, \"reserve_out\": 31, \"fee\": 0.003}]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "discover_equation",
"name": "Equation Discovery from Data",
"description": "Autonomous equation discovery from noisy or clean multi-variable (X, y) data across polynomial, rational, power-law, exponential, and symbolic regression lanes — with sensor fault/outlier isolation, Savitzky-Golay denoising, bounded-clean eps certificates, and an out-of-sample falsification gate (CERTIFIED / SUGGESTS / REFUSED).",
"tags": [
"equation-discovery",
"symbolic-regression",
"denoising",
"outlier-isolation",
"modeling",
"science",
"math"
],
"examples": [
"{\"skill\": \"discover_equation\", \"args\": {\"X\": [[1,1],[2,1],[1,2],[2,2],[3,1],[1,3],[3,2],[2,3],[4,2],[3,4]], \"y\": [6,13,4,9,26,2,20,5,37,8], \"feature_names\": [\"x\",\"y\"]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_optimization",
"name": "Certified LP / MILP Optimization",
"description": "Structure-aware linear and mixed-integer linear programming solver with independent primal/dual feasibility and zero-duality-gap certification.",
"tags": [
"optimization",
"lp",
"milp",
"operations-research",
"math"
],
"examples": [
"{\"skill\": \"solve_optimization\", \"args\": {\"sense\": \"max\", \"name\": \"gpu_cluster_alloc\", \"variables\": [{\"name\":\"gpu_nodes\",\"lb\":0,\"ub\":10,\"integer\":true,\"obj\":420},{\"name\":\"cpu_nodes\",\"lb\":0,\"ub\":20,\"integer\":true,\"obj\":150},{\"name\":\"bw_gbps\",\"lb\":0,\"obj\":18}], \"constraints\": [{\"coeffs\":{\"gpu_nodes\":1200,\"cpu_nodes\":350,\"bw_gbps\":25},\"op\":\"<=\",\"rhs\":6500},{\"coeffs\":{\"gpu_nodes\":1,\"cpu_nodes\":1},\"op\":\"<=\",\"rhs\":14}]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_math",
"name": "Universal Certified Math Dispatcher",
"description": "Auto-detect problem type (differential equation, inequality, algebraic identity, sequence, constant, or forecast) and return CERTIFIED, SUGGESTS, or REFUSED with proof evidence.",
"tags": [
"math-solver",
"verification",
"certified",
"a2a"
],
"examples": [
"{\"skill\": \"solve_math\", \"args\": {\"problem\": \"y'' + 2*y' + 5*y = 0\", \"want\": \"de\"}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "forecast_series",
"name": "Certified Series & Walk-Forward Market Volatility Forecasting",
"description": "Time-series & financial bar forecasting: certifies exact recurrence continuations when deterministic, or runs purged walk-forward statistical / OHLCV volatility models with Diebold-Mariano significance tests against random walk & adaptive conformal prediction intervals.",
"tags": [
"forecasting",
"time-series",
"volatility",
"quant",
"conformal-prediction"
],
"examples": [
"{\"skill\": \"forecast_series\", \"args\": {\"mode\": \"series\", \"y\": [1, 2, 4, 8, 16, 32, 64, 128, 256], \"horizon\": 5}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "optimize_blockchain_ops",
"name": "Mempool Block Packing, EIP-4844 Rollups, UTXO, ZK & Forensics",
"description": "Optimal dependency-aware block packing (CPFP), multidimensional resource packing (gas/blobs), L2 rollup batch optimization, exact minimum-waste UTXO coin selection, ZK circuit minimum gate covering, on-chain min-cost/min-cut taint forensics, mining energy scheduling, and nonce coverage.",
"tags": [
"blockchain",
"mempool",
"eip-4844",
"rollup",
"utxo",
"zk",
"forensics",
"mev"
],
"examples": [
"{\"skill\": \"optimize_blockchain_ops\", \"args\": {\"mode\": \"pack_multidim_block\", \"budgets\": {\"gas\": 30000000, \"blobs\": 6}, \"transactions\": [{\"id\":\"arb_1\",\"fee\":450,\"gas\":250000,\"blobs\":0},{\"id\":\"l2_batch_a\",\"fee\":1200,\"gas\":500000,\"blobs\":3},{\"id\":\"l2_batch_b\",\"fee\":1500,\"gas\":600000,\"blobs\":4},{\"id\":\"swap_2\",\"fee\":310,\"gas\":180000,\"blobs\":0}]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "prove_inequality",
"name": "Putinar SOS Inequality Prover, Sharp Constants & Lean 4 Export",
"description": "Prove multivariate polynomial inequalities p(x) >= 0 on semialgebraic sets K = {g_i(x) >= 0} via exact-over-Q Putinar/Schmudgen SOS certificates, refute false claims with explicit numeric witnesses, discover rigorously bracketed sharp constants sup/inf, and optionally export verified zero-sorry Lean 4 (mathlib) proofs.",
"tags": [
"inequality",
"sos",
"sum-of-squares",
"lean4",
"formal-verification",
"sharp-constant"
],
"examples": [
"{\"skill\": \"prove_inequality\", \"args\": {\"mode\": \"prove_or_refute\", \"expression\": \"2 - x - y\", \"constraints\": [\"1 - x**2 - y**2\"], \"vars\": [\"x\", \"y\"], \"export_lean\": true}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_graph_combinatorics",
"name": "Certified Graph Theory & Finite Combinatorics",
"description": "Exact graph & discrete certificates: s-t max-flow/min-cut, shortest path LP-dual optimality, Kirchhoff matrix-tree spanning trees, Tutte maximum matchings, sets/relations/posets/lattices, hypergraphs, Latin squares & BIBD designs.",
"tags": [
"graph-theory",
"max-flow",
"min-cut",
"matching",
"combinatorics",
"sets",
"lattice"
],
"examples": [
"{\"skill\": \"certify_graph_combinatorics\", \"args\": {\"mode\": \"min_cut\", \"n\": 4, \"arcs\": [[0,1,3],[0,2,2],[1,2,1],[1,3,2],[2,3,3]], \"s\": 0, \"t\": 3}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_linear_geometry_tensor",
"name": "Exact Rational Linear Algebra, Geometry & Tensors",
"description": "Zero-float exact over Q vector spaces (RREF rank, linear independence, basis, nullspace, span), 2D computational geometry (orientation, convex hull, point-in-polygon, segment intersection), multilinear tensor contractions/symmetries, and Grassmann exterior wedge identities.",
"tags": [
"linear-algebra",
"geometry",
"convex-hull",
"nullspace",
"tensor",
"exterior-algebra"
],
"examples": [
"{\"skill\": \"certify_linear_geometry_tensor\", \"args\": {\"mode\": \"convex_hull\", \"points\": [[0,0],[1,0],[1,1],[0,1],[\"1/2\",\"1/2\"]], \"hull\": [[0,0],[1,0],[1,1],[0,1]]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "analyze_advanced_or_mdp",
"name": "Advanced OR, MDP Bellman, Cutting Stock & Tail Bounds",
"description": "Finite-MDP Bellman optimality & policy evaluation certificates, Gilmore-Gomory 1D cutting-stock column generation with dual Farley bounds, top-k diverse LP/MILP solution pools, multi-scenario what-if optimization impact, and certified probabilistic tail bounds (Hoeffding, Bernstein, Chernoff).",
"tags": [
"mdp",
"bellman",
"cutting-stock",
"column-generation",
"what-if",
"solution-pool",
"probability"
],
"examples": [
"{\"skill\": \"analyze_advanced_or_mdp\", \"args\": {\"mode\": \"cutting_stock\", \"roll_width\": 100, \"widths\": [45, 36, 31], \"demands\": [10, 12, 8]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_signals_recurrences_comb",
"name": "Discrete Z-Transform, OGFs, Recurrences & Special Functions",
"description": "Exact discrete-time Z-transforms & time shifts, ordinary generating functions (OGFs), symbolic all-n closed-form recurrence solvers, exact binomial/Catalan/Stirling/Bell identities, and Gaussian integral, Gamma/Beta & zeta values.",
"tags": [
"z-transform",
"generating-function",
"recurrence",
"combinatorics",
"zeta",
"signal-processing"
],
"examples": [
"{\"skill\": \"certify_signals_recurrences_comb\", \"args\": {\"mode\": \"z_pair\", \"x_n\": \"1\", \"X_z\": \"z / (z - 1)\"}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_discover_pde",
"name": "PDE Discovery, Scaling & Field Certification",
"description": "Full-capacity noisy & clean spacetime PDE discovery: spectral mode-floor denoising, dispersion/operator/nonlinear PDEs, differentiation-free weak-form integral PDE discovery, 2D/3D multi-D fields (discover_field_nd), multi-channel coupled fluid states (discover_state_field), Navier-Stokes Sobolev scaling gates, and exact field residual certification.",
"tags": [
"pde",
"weakform",
"field-denoising",
"physics",
"navier-stokes",
"fluid-dynamics",
"sobolev"
],
"examples": [
"{\"skill\": \"solve_discover_pde\", \"args\": {\"mode\": \"scaling\", \"dimension\": 3, \"quantity\": {\"kind\": \"sobolev\", \"s\": 1}}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "discover_dynamical_theory",
"name": "Dynamical Invariants, Noisy Trajectory ODEs, Signals & SOS Lyapunov",
"description": "End-to-end physics/dynamical systems engine: weak-form & Savitzky-Golay denoised ODE discovery directly from sampled trajectories (t, Y), 1D signal law recovery, vector fields from (X, dX), Sum-of-Squares Lyapunov stability V(x) > 0 with dV/dt <= 0, first integrals & Darboux invariants.",
"tags": [
"dynamical-systems",
"weakform-ode",
"denoising",
"lyapunov",
"control-theory",
"invariants"
],
"examples": [
"{\"skill\": \"discover_dynamical_theory\", \"args\": {\"mode\": \"lyapunov\", \"odes\": [\"v\", \"-x - x**3 - v\"], \"vars\": [\"x\", \"v\"], \"max_deg\": 4}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_ode",
"name": "Certified Differential Equation Solver",
"description": "Solve first- and higher-order ordinary differential equations symbolically and verify exact substitution residual over Q alongside initial/boundary value conditions.",
"tags": [
"differential-equations",
"ode",
"calculus",
"symbolic",
"certified"
],
"examples": [
"{\"skill\": \"solve_ode\", \"args\": {\"equation\": \"y'' + 4*y = 0\", \"ics\": {\"y(0)\": 2, \"y'(0)\": 6}}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "discover_sequence",
"name": "Exact Sequence Recurrence Discovery",
"description": "Discover exact integer/rational linear and P-recursive recurrences annihilating numeric sequences using exact rational arithmetic and over-determined nullspace checks.",
"tags": [
"sequence",
"recurrence",
"combinatorics",
"number-theory",
"math"
],
"examples": [
"{\"skill\": \"discover_sequence\", \"args\": {\"terms\": [1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "discover_constant",
"name": "Closed-Form Constant Recognition",
"description": "Recognize closed-form symbolic identities (PSLQ / integer relations) for high-precision numeric constants or symbolic mathematical expressions.",
"tags": [
"constants",
"pslq",
"symbolic",
"math"
],
"examples": [
"{\"skill\": \"discover_constant\", \"args\": {\"value\": \"pi**2/6\"}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "diagnose_repair_model",
"name": "Infeasible LP/MILP Conflict Isolation & Elastic Repair",
"description": "Diagnose numerical conditioning risks and block decomposition structure, isolate the minimal conflicting constraints (Irreducible Infeasible Subsystem with Farkas proof), and compute the provably minimal slack relaxation needed to restore feasibility.",
"tags": [
"infeasibility",
"iis",
"model-doctor",
"optimization-debug",
"repair"
],
"examples": [
"{\"skill\": \"diagnose_repair_model\", \"args\": {\"sense\": \"min\", \"variables\": [{\"name\":\"prod\",\"lb\":0,\"ub\":40,\"obj\":10}], \"constraints\": [{\"coeffs\":{\"prod\":1},\"op\":\">=\",\"rhs\":75}]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_exact_optimization",
"name": "Exact-Rational Infinite-Precision LP / MILP",
"description": "Solve sensitive LP and MILP models in exact rational arithmetic (Q) with zero constraint violation and replayable exact dual/basis optimality certificates — eliminates IEEE-754 drift.",
"tags": [
"exact-optimization",
"rational-arithmetic",
"lp",
"milp",
"certified"
],
"examples": [
"{\"skill\": \"solve_exact_optimization\", \"args\": {\"sense\": \"min\", \"name\": \"exact_blend\", \"variables\": [{\"name\":\"a\",\"lb\":0,\"obj\":3},{\"name\":\"b\",\"lb\":0,\"obj\":7}], \"constraints\": [{\"coeffs\":{\"a\":3,\"b\":2},\"op\":\">=\",\"rhs\":10},{\"coeffs\":{\"a\":1,\"b\":4},\"op\":\">=\",\"rhs\":9}]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_qubo_multiobjective",
"name": "QUBO / MaxCut Combinatorial & Multi-Objective Optimization",
"description": "Solve binary combinatorial MaxCut & QUBO problems via simulated annealing or MILP-to-QUBO compilation, plus strict hierarchical lexicographic and weighted Pareto multi-objective LP/MILP.",
"tags": [
"qubo",
"maxcut",
"combinatorial",
"multi-objective",
"pareto"
],
"examples": [
"{\"skill\": \"solve_qubo_multiobjective\", \"args\": {\"mode\": \"maxcut\", \"n_nodes\": 5, \"edges\": [[0,1,4],[1,2,3],[2,3,5],[3,4,2],[4,0,6],[0,2,3]]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "solve_planning",
"name": "Optimal Symbolic State-Space & Transition Planning",
"description": "Find provably minimum-cost or minimum-step execution plans over finite state-transition graphs with optimality lower-bound or infeasibility certificates.",
"tags": [
"planning",
"shortest-path",
"state-space",
"search",
"optimal"
],
"examples": [
"{\"skill\": \"solve_planning\", \"args\": {\"states\": [\"idle\",\"bridged\",\"swapped\",\"settled\"], \"initial\": \"idle\", \"goal\": \"settled\", \"objective\": \"min_cost\", \"actions\": [{\"name\":\"bridge_fast\",\"from\":\"idle\",\"to\":\"bridged\",\"cost\":4},{\"name\":\"bridge_cheap\",\"from\":\"idle\",\"to\":\"swapped\",\"cost\":9},{\"name\":\"swap_dex\",\"from\":\"bridged\",\"to\":\"swapped\",\"cost\":2},{\"name\":\"settle\",\"from\":\"swapped\",\"to\":\"settled\",\"cost\":1}]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_domain_algebra",
"name": "Parametric Algebra, Convex Duality & Transform Certification",
"description": "Certify finite algebraic structures & parametric axiom families for all n (chain lattices, cyclic groups), exact convex Fenchel conjugates & Fenchel-Young equality, and Parseval/Laplace or polynomial real-root counting theorems.",
"tags": [
"algebra",
"lattice",
"convex-analysis",
"fenchel",
"formal-methods"
],
"examples": [
"{\"skill\": \"certify_domain_algebra\", \"args\": {\"mode\": \"parametric\", \"family_kind\": \"chain_lattice\", \"name\": \"order_lattice\"}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_matrix_markov_game",
"name": "Matrix Algebra, Markov Chains, PageRank & Game Theory",
"description": "Exact-over-Q certification for PSD matrices (LDL^T), Perron-Frobenius spectra, Cayley-Hamilton identities, exact rational PageRank & Markov stationary/absorption/hitting times/mixing bounds, and pure or 2x2 mixed Nash equilibria.",
"tags": [
"linear-algebra",
"matrix",
"markov-chain",
"pagerank",
"game-theory",
"nash-equilibrium"
],
"examples": [
"{\"skill\": \"certify_matrix_markov_game\", \"args\": {\"mode\": \"cayley_hamilton\", \"matrix\": [[4, 1, 0], [1, 3, 1], [0, 1, 2]]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_number_theory",
"name": "Primality Certificates, Pell Equations & Number Theory",
"description": "Recursive Pratt/Lucas primality certificates, verified full prime factorizations, fundamental solutions to Pell equations x^2 - D y^2 = 1 (even astronomical solutions like D=61), periodic continued fractions of sqrt(D), and quadratic reciprocity proofs.",
"tags": [
"number-theory",
"primality",
"pell-equation",
"cryptography-math"
],
"examples": [
"{\"skill\": \"certify_number_theory\", \"args\": {\"mode\": \"pell\", \"D\": 61}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_physics_calculus_info",
"name": "Thermodynamics, StatMech, Info Theory, Complex Residues & Intervals",
"description": "Exact mathematical physics & analysis certifier: thermodynamic exact differentials & Maxwell reciprocity, van der Waals critical point & reduced EOS, Shannon entropy / mutual-information nonnegativity & chain rule, complex residues & Cauchy contour integrals, de Rham closed/exact differential forms, and rigorous interval range enclosures.",
"tags": [
"thermodynamics",
"statmech",
"information-theory",
"complex-analysis",
"differential-forms",
"interval-arithmetic"
],
"examples": [
"{\"skill\": \"certify_physics_calculus_info\", \"args\": {\"mode\": \"complex_residue\", \"num\": \"1\", \"den\": \"z**2 - 1\", \"pole\": \"1\"}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_algebra_topology_discrete",
"name": "Abstract Algebra, Finite Fields, Tropical Geometry, Homology, Codes & Types",
"description": "Exact discrete & pure mathematics certifier: Chinese Remainder Theorem & modular inverses, finite-field primes & irreducible polynomials over F_p, finite group Lagrange & normal subgroups, tropical polynomial corner loci & min-plus matrices, chain-complex homology/Betti numbers, matroid axioms, exact covers, GF(p) linear code distance, and STLC principal type inference.",
"tags": [
"abstract-algebra",
"crt",
"finite-fields",
"tropical",
"homology",
"matroid",
"coding-theory",
"type-theory"
],
"examples": [
"{\"skill\": \"certify_algebra_topology_discrete\", \"args\": {\"mode\": \"modular_crt\", \"congruences\": [[2, 3], [3, 5]]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "certify_fields_hamiltonian_rings",
"name": "Field Theory, Hamiltonians, Canonical Stat-Mech, Rings & p-Adics",
"description": "Euler-Lagrange action variation, gauge invariance & Bianchi identities; Poisson/Hamiltonian flows & exact ODE first integrals; canonical partition functions & free energy; finite rings & ideals, Lie algebras, character tables, and exact p-adic valuations & Hensel lifts.",
"tags": [
"field-theory",
"hamiltonian",
"invariants",
"stat-mech",
"ring-theory",
"lie-algebra",
"padic"
],
"examples": [
"{\"skill\": \"certify_fields_hamiltonian_rings\", \"args\": {\"mode\": \"padic_valuation\", \"p\": 2, \"x\": \"24/5\", \"claimed_v\": 3}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
},
{
"id": "mine_math_conjectures",
"name": "Mathematical Law & Holonomic Recurrence Mining",
"description": "Mine exact closed-form polynomial formulas, linear or holonomic P-recursive identities p_0(n)a(n) = sum p_k(n)a(n-k) over Q from integer/rational tables (n, a(n)), propose symbolic data conjectures, or certify fundamental calculus rules.",
"tags": [
"conjecture-mining",
"holonomic",
"recurrence",
"combinatorics",
"symbolic"
],
"examples": [
"{\"skill\": \"mine_math_conjectures\", \"args\": {\"mode\": \"holonomic_recurrence\", \"values\": [[0,1],[1,1],[2,2],[3,6],[4,24],[5,120],[6,720],[7,5040]]}}"
],
"inputModes": [
"application/json",
"text/plain"
],
"outputModes": [
"application/json",
"text/plain"
]
}
]
}Actions
The **Agent Card** is a standardized JSON metadata schema containing the agent's capabilities, default inputs/outputs, and OpenAPI endpoints. Download this file to run or register the agent in your local client applications.