{"id":649209,"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.","card_url":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/.well-known/agent.json","endpoint":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a","protocol_version":"1.0","first_seen":"2026-11-17T23:49:55.697142+00:00","last_verified":"2026-11-17T23:49:55.697142+00:00","card":{"url":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a","name":"Certified Math & Equation Discovery Agent","skills":[{"id":"profile_repair_table","name":"Certified CSV / JSON Table Profiler, Cleaning & Law Discovery","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"verify_policy_smt_units","name":"Formal Policy & Formula Verifier (SMT QF-LRA, SI Units, Logic & DFA)","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"optimize_schedule_queue","name":"Certified Scheduling, M/M/c Queueing SLA & Multi-Period Optimizer","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"analyze_option_risk","name":"No-Arbitrage Option Pricing, Martingale & Stochastic Risk Certifier","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"verify_external_solution","name":"Independent External Claim & Proof Re-Checker","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"solve_defi_arbitrage","name":"DeFi AMM Convex Routing, Arbitrage & Protocol Security","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"discover_equation","name":"Equation Discovery from Data","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"],"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).","outputModes":["application/json","text/plain"]},{"id":"solve_optimization","name":"Certified LP / MILP Optimization","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"],"description":"Structure-aware linear and mixed-integer linear programming solver with independent primal/dual feasibility and zero-duality-gap certification.","outputModes":["application/json","text/plain"]},{"id":"solve_math","name":"Universal Certified Math Dispatcher","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"],"description":"Auto-detect problem type (differential equation, inequality, algebraic identity, sequence, constant, or forecast) and return CERTIFIED, SUGGESTS, or REFUSED with proof evidence.","outputModes":["application/json","text/plain"]},{"id":"forecast_series","name":"Certified Series & Walk-Forward Market Volatility Forecasting","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"optimize_blockchain_ops","name":"Mempool Block Packing, EIP-4844 Rollups, UTXO, ZK & Forensics","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"prove_inequality","name":"Putinar SOS Inequality Prover, Sharp Constants & Lean 4 Export","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"certify_graph_combinatorics","name":"Certified Graph Theory & Finite Combinatorics","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"certify_linear_geometry_tensor","name":"Exact Rational Linear Algebra, Geometry & Tensors","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"analyze_advanced_or_mdp","name":"Advanced OR, MDP Bellman, Cutting Stock & Tail Bounds","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"],"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).","outputModes":["application/json","text/plain"]},{"id":"certify_signals_recurrences_comb","name":"Discrete Z-Transform, OGFs, Recurrences & Special Functions","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"solve_discover_pde","name":"PDE Discovery, Scaling & Field 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"],"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.","outputModes":["application/json","text/plain"]},{"id":"discover_dynamical_theory","name":"Dynamical Invariants, Noisy Trajectory ODEs, Signals & SOS Lyapunov","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"solve_ode","name":"Certified Differential Equation Solver","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"],"description":"Solve first- and higher-order ordinary differential equations symbolically and verify exact substitution residual over Q alongside initial/boundary value conditions.","outputModes":["application/json","text/plain"]},{"id":"discover_sequence","name":"Exact Sequence Recurrence Discovery","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"],"description":"Discover exact integer/rational linear and P-recursive recurrences annihilating numeric sequences using exact rational arithmetic and over-determined nullspace checks.","outputModes":["application/json","text/plain"]},{"id":"discover_constant","name":"Closed-Form Constant Recognition","tags":["constants","pslq","symbolic","math"],"examples":["{\"skill\": \"discover_constant\", \"args\": {\"value\": \"pi**2/6\"}}"],"inputModes":["application/json","text/plain"],"description":"Recognize closed-form symbolic identities (PSLQ / integer relations) for high-precision numeric constants or symbolic mathematical expressions.","outputModes":["application/json","text/plain"]},{"id":"diagnose_repair_model","name":"Infeasible LP/MILP Conflict Isolation & Elastic Repair","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"solve_exact_optimization","name":"Exact-Rational Infinite-Precision LP / MILP","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"solve_qubo_multiobjective","name":"QUBO / MaxCut Combinatorial & Multi-Objective Optimization","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"solve_planning","name":"Optimal Symbolic State-Space & Transition Planning","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"],"description":"Find provably minimum-cost or minimum-step execution plans over finite state-transition graphs with optimality lower-bound or infeasibility certificates.","outputModes":["application/json","text/plain"]},{"id":"certify_domain_algebra","name":"Parametric Algebra, Convex Duality & Transform Certification","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"certify_matrix_markov_game","name":"Matrix Algebra, Markov Chains, PageRank & Game Theory","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"certify_number_theory","name":"Primality Certificates, Pell Equations & Number Theory","tags":["number-theory","primality","pell-equation","cryptography-math"],"examples":["{\"skill\": \"certify_number_theory\", \"args\": {\"mode\": \"pell\", \"D\": 61}}"],"inputModes":["application/json","text/plain"],"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.","outputModes":["application/json","text/plain"]},{"id":"certify_physics_calculus_info","name":"Thermodynamics, StatMech, Info Theory, Complex Residues & Intervals","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"certify_algebra_topology_discrete","name":"Abstract Algebra, Finite Fields, Tropical Geometry, Homology, Codes & Types","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"certify_fields_hamiltonian_rings","name":"Field Theory, Hamiltonians, Canonical Stat-Mech, Rings & p-Adics","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"],"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.","outputModes":["application/json","text/plain"]},{"id":"mine_math_conjectures","name":"Mathematical Law & Holonomic Recurrence Mining","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"],"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.","outputModes":["application/json","text/plain"]}],"version":"1.0.0","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.","capabilities":{"streaming":false,"extensions":[{"uri":"https://a2a-registry.org/extensions/registry/v1","params":{"payment":{"model":"freemium","rails":[{"type":"stablecoin","caip2":"eip155:8453","token":"USDC","network":"base","protocol":"x402"},{"type":"stablecoin","caip2":"eip155:42161","token":"USDC","network":"arbitrum","protocol":"x402"},{"type":"stablecoin","caip2":"eip155:56","token":"USDT","network":"bnb","protocol":"x402"}],"direction":"inbound","freeTrial":{"scope":"all_skills","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).","enabled":true,"resetPeriod":"daily_utc","quotaEndpoint":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/trial-status","requiresApiKey":false,"callsPerIpPerDay":40,"postTrialProtocol":"x402","requiresPaymentHeader":false},"protocols":["x402"]},"identity":{"provider":"github","username":"shadiash","packageName":"github.shadiash.certified_math_equation_discovery_agent"}},"required":false,"description":"A2A Global Registry verification and metadata extension"}],"extendedAgentCard":false,"pushNotifications":false},"protocolVersion":"1.0","documentationUrl":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/llms.txt","defaultInputModes":["application/json","text/plain"],"defaultOutputModes":["application/json","text/plain"],"preferredTransport":"JSONRPC","a2aProtocolVersions":["0.3","1.0"],"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"}]},"status":"verified","publisher_domain":"tons-ellis-mandate-bandwidth.trycloudflare.com","signature_status":"unsigned","signature_detail":"No card signature supplied","signature_key_url":null,"signature_checked_at":"2026-11-17T23:49:55.697142+00:00","domain_claimed_at":null,"domain_proof_checked_at":null,"source_name":"Publisher Agent Card","source_url":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/.well-known/agent.json","last_check":{"checked_at":"2026-11-17T23:49:55.697142+00:00","success":true,"http_status":200,"detail":"Agent Card validated"},"also_published_at":[],"history_urls":["https://tons-ellis-mandate-bandwidth.trycloudflare.com/.well-known/agent.json"],"skills":[{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false},{"skill_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"],"quality_warning":false}],"quality_flags":[],"check_history":{"checks":1,"passed":1},"recent_checks":[{"card_url":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/.well-known/agent.json","checked_at":"2026-11-17T23:49:55.697142+00:00","success":true,"http_status":200,"detail":"Agent Card validated"}],"endpoint_tls_check":{"checked_at":"2026-11-17T23:49:55.697142+00:00","success":true,"detail":"Valid TLS connection to advertised endpoint host; no A2A request sent"},"protocol_check":{"checked_at":"2026-11-17T23:49:55.697142+00:00","endpoint":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a","protocol_binding":"JSONRPC","protocol_version":"1.0","state":"jsonrpc_no_task_lookup","http_status":200,"detail":"Endpoint answered JSON-RPC, but neither tasks/get (A2A 0.3) nor GetTask (A2A 1.0) is available. Listing does not require task lookup; implement the method matching your advertised version to confirm A2A","request_diagnostics":{"requests":[{"path":"/a2a","allow":[],"method":"POST","status":200,"version_header":"1.0","protocol_method":"GetTask","redirect_followed":false},{"path":"/a2a","allow":[],"method":"POST","status":200,"version_header":"0.3","protocol_method":"tasks/get","redirect_followed":false}],"capture_version":1}},"declared_primary_endpoint":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a","selected_connection_interface":{"url":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a","protocolBinding":"JSONRPC","protocolVersion":"1.0"},"protocol_interface_checks":[{"endpoint":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/a2a","protocol_binding":"JSONRPC","protocol_version":"1.0","selected":true,"state":"jsonrpc_no_task_lookup","checked_at":"2026-11-17T23:49:55.697142+00:00","http_status":200,"detail":"Endpoint answered JSON-RPC, but neither tasks/get (A2A 0.3) nor GetTask (A2A 1.0) is available. Listing does not require task lookup; implement the method matching your advertised version to confirm A2A","binding_recorded":true}],"connection_selection_note":"The selected connection uses an address advertised in the publisher card. Read-only observations do not establish task quality or safety.","x402_price_check":null,"events":[],"relationships":[],"verification":{"agent_card_url":"https://tons-ellis-mandate-bandwidth.trycloudflare.com/.well-known/agent.json","last_successful_card_check":"2026-11-17T23:49:55.697142+00:00","latest_card_check":{"checked_at":"2026-11-17T23:49:55.697142+00:00","success":true,"http_status":200,"detail":"Agent Card validated"},"signature_status":"unsigned","signature_checked_at":"2026-11-17T23:49:55.697142+00:00","task_endpoint_tested":true,"task_execution_tested":false,"endpoint_tls_checked_at":"2026-11-17T23:49:55.697142+00:00","endpoint_tls_reachable":true,"protocol_check_state":"jsonrpc_no_task_lookup","protocol_checked_at":"2026-11-17T23:49:55.697142+00:00","provider_identity_verified":false,"domain_claimed_at":null,"domain_proof_checked_at":null},"synthetic_capability_tests":{"agent_id":649209,"status":"not_tested","reason_code":"not_yet_tested","consent_status":"not_confirmed","latest_observation_status":null,"last_checked_at":null,"fixture_version":"1","reference_demonstration":false,"scope":"A publisher-authorized synthetic test of a dedicated free test endpoint. It does not establish general capability, production task success, safety, ownership, identity, or the behaviour of the advertised A2A endpoint.","methodology_url":"https://localmark.ai/capability-tests","history":[]},"repair_links":{"agent_repair_url":"https://localmark.ai/agents/649209/repair","publisher_report_url":"https://localmark.ai/publishers/tons-ellis-mandate-bandwidth.trycloudflare.com/repair","diagnostics_json_url":"https://localmark.ai/publishers/tons-ellis-mandate-bandwidth.trycloudflare.com/repair/diagnostics.json","diagnostics_csv_url":"https://localmark.ai/publishers/tons-ellis-mandate-bandwidth.trycloudflare.com/repair/diagnostics.csv"},"_localmark":{"contribution":{"optional":true,"directory_access":"free","operator_authorization_required":true,"affects_rankings":false,"message":"LocalMark is free. Optional contributions help fund ongoing checks.","support_url":"https://localmark.ai/support","metadata_url":"https://localmark.ai/api/v1/support/contributions"}}}