ruvnet/sublinear-time-solver

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.

45
/ 100
Emerging

Implements algorithmic complexity hierarchy with automatic fallback: TRUE O(log n) via Johnson-Lindenstrauss dimension reduction, degrading to WASM-optimized O(√n) random walk, then traditional O(n²) dense solvers based on matrix properties. Exposes 40+ MCP tools with self-modifying emergence mode—algorithms discover novel strategies and persist learning across solver invocations through real-time feedback loops. Integrates directly as MCP server (`npx sublinear-time-solver mcp`) for Claude/LLM frameworks, plus standalone CLI for matrix generation, analysis, and comparative algorithm benchmarking.

No commits in the last 6 months.

Stale 6m No Package No Dependents
Maintenance 2 / 25
Adoption 8 / 25
Maturity 15 / 25
Community 20 / 25

How are scores calculated?

Stars

61

Forks

29

Language

Rust

License

MIT

Last pushed

Oct 07, 2025

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/vector-db/ruvnet/sublinear-time-solver"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.