Dev tools · alternatives · 2026
24 alternatives to Compute Polynomials Twice as Fast
Evaluate a degree-n polynomial with about n/2 multiplications. Type a polynomial, pick ℚ, ℝ, ℂ, a Mersenne prime or a binary field, and get the preprocessed evaluation chain as math, C code or a circuit — everything runs in your browser.
Compute Polynomials Twice as Fast is a browser-based tool that evaluates polynomials using approximately half the multiplications required by traditional methods. Users input a polynomial and select from various number… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1AN
2018 · github.com · its alternatives →
- 2SU
Here's a project I've been working on for the last few months. It's a new (I think) algorithm, that allows to adjust smoothly - and in real time - how many calculations you'd like to do during inference of an LLM model. It seems that it's possible to do just 20-25% of weight multiplications instead of all of them, and still get good inference results. I implemented it to run on M1/M2/M3 GPU. The mmul approximation itself can be pushed to run 2x fast before the quality of output collapses. The inference speed is just a bit faster than Llama.cpp's, because the rest of implementation…
2024 · asciinema.org · its alternatives →
- 3IM
I've been studying interval arithmetic for the past few weeks and it's a really interesting field because while there is a ton of super interesting research published over the past decades, it has never really gotten the recognition that it deserves, IMO. One reason for this is that standard interval arithmetic has really poor handling of division by intervals containing zero. If you compute 1 / [-1, 2] in regular interval arithmetic, you get either [-∞, +∞], or you have to say that the operation is undefined. Both solutions are virtually useless. The real answer of course is [-∞, -1] U…
Apr 2026 · victorpoughon.github.io · its alternatives →
- 4CA
Hi everyone, here's a web app I made that generates code for efficiently approximating mathematical functions. This is useful when performance matters more than perfect accuracy, for example in embedded systems. The app uses Chebyshev expansions, which despite their theoretical depth result in suprisingly compact and readable code in practice. This code is generated for you and using it does not require any knowledge of the underlying theory. Source code and more info: https://github.com/stuffmatic/chebyshev-calculator
2024 · stuffmatic.com · its alternatives →
- 5
Everything about Polynomials: solutions, proofs & graphs
2025 · apps.apple.com · its alternatives →
- 6AM
2012 · github.com · its alternatives →
- 7MM
2024 · github.com · its alternatives →
- 8GC
Achieved a new world record in verifying the Goldbach Conjecture using grid computing, by extending the verification up to 4 quadrillion (4×10¹⁸) + 70 trillion (7×10¹³). My grid computing system - Gridbach is a cloud-based distributed computing system accessible from any PC or smartphone. It requires no login or app installation. The high-performance WASM (WebAssembly) binary code is downloaded as browser content, enabling computation on the user’s browser. [Website] https://gridbach.com/ [Medium]…
2025 · medium.com · its alternatives →
- 9IP
2017 · duetosymmetry.com · its alternatives →
- 10XE
2016 · github.com · its alternatives →
- 11
Zero-Knowledge Proofs (ZKPs) let an untrusted proved show that computation was executed correctly without revealing the inputs to the verifier. However to prove anything, the computation first has to be expressed as a circuit: a system of polynomial equations (constraints) over a finite field. Circuits are the assembly language of zk and every constraint costs prover (and sometimes verifier) time, so production circuits are aggressively hand-optimized. Over the last months, we have been experimenting with writing formal specifications instead and letting LLMs produce the circuits: as long as…
Jul 2026 · zk.golf · its alternatives →
- 12TA
Credit goes to the contributors of https://github.com/enjeck/num2math for making the tool's core.
2024 · scientific.place · its alternatives →
- 13LF
LoopMix128 is a fast C PRNG I wrote for non-cryptographic tasks. GitHub (MIT): https://github.com/danielcota/LoopMix128 Highlights: * ~0.37 ns/value (GCC 11.4, -O3 -march=native), 98% faster than xoroshiro128++ and PCG64. * Passes TestU01 BigCrush & PractRand (32TB). * Guaranteed 2^128 period. * Proven injective (192-bit state) via Z3 SMT solver; allows parallel streams. * Core requires only stdint.h. Seeking feedback on design, use cases, or further testing.
2025 · github.com · its alternatives →
- 14
A new programming language rooted in Pure Mathematics
2025 · leetarxiv.substack.com · its alternatives →
- 15IP
2017 · strandmark.net · its alternatives →
- 16FS
I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…
2023 · ashvardanian.com · its alternatives →
- 17AO
2013 · github.com · its alternatives →
- 18VP
2016 · github.com · its alternatives →
- 19HM
2017 · github.com · its alternatives →
- 20
Current support for nonlinear inequalities in Lean is quite limited. This package attempts to solve this. It contains a collection of Lean4 tactics for proving polynomial inequalities via sum-of-squares (SOS) decompositions, powered by a Python backend. You can use it via Python or Lean. These tactics are significantly more powerful than `nlinarith` and `positivity` -- i.e., they can prove inequalities they cannot. In theory, they can be used to prove any of the following types of statements - prove that a polynomial is nonnegative globally - prove that a polynomial is nonnegative over a…
Apr 2026 · github.com · its alternatives →
- 21VA
Wrote this to learn more about the `chumsky` parser combinator library, rustyline, and the `ariadne` error reporting crate. Such a nice DX combo for writing new languages. Still a work in progress, but I thought I'd share :)
2025 · github.com · its alternatives →
- 2224
2023 · gist.github.com · its alternatives →
- 23SM
2015 · github.com · its alternatives →
- 24CI
Author: Danison Nuñez Project: Coderive Project Type: Programming Language Highlight: Formula-based Execution ## Coderive - Iterating Through 1 Quintillion in a Loop *Subtitle: How a phone interpreter achieves what supercomputers cannot* The Impossible Loop: ```java // In any other language, this would be computational suicide for i in [0 to 1Qi] { // 1,000,000,000,000,000,000 iterations arr[i] = i * i } ``` Traditional Reality: · Python: MemoryError at array creation · Java/C++: Theoretical 31 years (with 8 exabytes of RAM) · NumPy/TensorFlow: Immediate crash ·…
Dec 2025 · github.com · its alternatives →
Also compare
- Algebraic Number Theory in Python 3 alternatives
- Speeding up LLM inference 2x times (possibly) alternatives
- I made a calculator that works over disjoint sets of intervals alternatives
- Chebyshev approximation calculator alternatives
- Polynomial Solver Step by Step alternatives
- Advanced Mathematics Library for Node.js and JavaScript alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →