{"repo":"ruvnet/sublinear-time-solver","free":true,"listed":false,"github":"https://github.com/ruvnet/sublinear-time-solver","clone":"git clone https://github.com/ruvnet/sublinear-time-solver.git","description":"Rust + WASM sublinear-time solver for asymmetric diagonally dominant systems. Exposes Neumann series, push, and hybrid random-walk algorithms with npm/npx CLI and Flow-Nexus HTTP streaming for swarm cost propagation and verification.","language":"Rust","stars":89,"topics":["graph-laplacian","iterative-solvers","mcp-tools","model-context-protocol","numerical-linear-algebra","pagerank-algorithm","rust-wasm","scientific-computing","sparse-linear-solver","sublinear-algorithms"],"license":"MIT","category":"mcp-servers","readme_excerpt":"🚀 The Ultimate Mathematical & AI Toolkit v1.6.0 The Ultimate Mathematical & AI Toolkit: Sublinear algorithms, consciousness exploration, psycho-symbolic reasoning, and temporal prediction in one unified MCP interface. WASM-accelerated with emergent behavior analysis. ⚠️ Security posture (1.6.0+) : This release closed issue #19 (CWE-73, Arbitrary File Write) in the MCP tools. Every PR is now gated by five supply-chain layers ( cargo-audit against RustSec, cargo-deny for license + source + ban policy, npm-audit , GitHub's dependency-review-action , and a lockfile-integrity check) plus the original safe-path regression suite. Dependabot files dep updates as PRs weekly so the gates fire on each one. See CHANGELOG.md for the v1.6.0 breaking-change upgrade guide and BENCHMARK.md for performance numbers. 🚀 Quick Start Install Direct CLI Usage 🧮 Complexity as a First-Class API Surface Every public solver, sampler, and analyser in this crate declares its worst-case complexity class at the type level ( Complexity trait, compile-time const CLASS ) and at the MCP wire level ( x-complexity JSON Schema extension on every tool). Callers with a J/decision budget — Cognitum reflex loops, RuView change detection, Ruflo agentic inner loops — can refuse anything over budget at tool-list time , not after the call returns. The 12-tier taxonomy ( Logarithmic → DoubleExponential , plus Adaptive { default, worst } for solvers that degrade on hard inputs) lives in src/complexity.rs . The decision r","default_branch":null,"files":null,"tree":[],"storefront":"/r/ruvnet","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/ruvnet/sublinear-time-solver/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}