Use fft.js with your AI.
Connect your account once and let the AI you already use work with it, without building another integration. Calculate Fast Fourier Transforms (FFT) on time-series data local. Extract dominant frequencies from signals, audio, or financial cycles with mathematical perfe
Developed, maintained, and hosted by Vinkius.
MCP VERIFIED · PRODUCTION READY · VINKIUS GUARANTEED
Waiting for input…
Works with modern AI clients that support MCP, including ChatGPT, Claude, Cursor, and more.
Complete set · 1 capability
The complete fft.js capability set.
These are the exact actions your AI can choose when you ask it to work with fft.js.
01
1 capability in this set.
Part of 1 available through fft.js.
- 01
Calculate fft
Perform Fast Fourier Transform (FFT) on time-series numeric arrays to extract frequency components
Observed, not estimated
816ms average. Fast in production.
fft.js is checked daily against the live service.
- Fastest day
- 666ms
- Slowest day
- 1057ms
- 14-day trend
- Slowing+21%
Connect your client
One URL. Every client.
Activate the Connector, copy your link, and paste it into the client you already use. 1 capability arrives ready to run.
Preview access · not provider authentication
The vk_preview_* token belongs to Vinkius preview infrastructure. It lets Claude discover and display the capabilities of fft.js, so you can see the experience inside your AI.
It does not authenticate your account with fft.js. Actions requiring credentials or live account data may not run until you activate the Connector and authorize the service.
fft.js Connector
You're all set. Choose your MCP client and follow the setup instructions.
https://edge.vinkius.com/vk_preview_OgVdcAJ5c4akzqqyOKLcs4VoR2ziukAMExZvS9jD/mcpClaude Desktop
Follow the steps below to connect in seconds.
- 1In Claude Desktop, open Settings → Connectors.
- 2Click “Add custom connector” and paste the connector link above as the remote MCP server URL.
- 3Click Add and start a new chat — fft.js capabilities are ready to use.
{
"mcpServers": {
"fourier-transform-engine-mcp": {
"url": "https://edge.vinkius.com/vk_preview_OgVdcAJ5c4akzqqyOKLcs4VoR2ziukAMExZvS9jD/mcp"
}
}
}
Claude
ChatGPT
Cursor
VS Code
Windsurf
Claude Code
JetBrains
Cline
Step-by-step instructions for each client are in the guide. How to connect
FAQ
Questions fft.js owners ask.
- 01
Does my array length need to be a power of 2?
No. The engine automatically zero-pads your signal to the nearest power of 2 before transforming. You can send any array length.
- 02
What format is the output?
The engine returns a JSON containing the top 3 dominant frequency bin indices with their magnitudes, plus a preview array of the first 10 absolute magnitudes for quick analysis.
- 03
Can it perform inverse FFT (IFFT)?
Currently, this capability is optimized for forward FFT frequency extraction. A dedicated IFFT capability for signal reconstruction could be added in future updates.
Explore
More in Developer Tools
TF-IDF Vectorizer Engine AI Connector
Exact Term Frequency-Inverse Document Frequency scores. Stop LLMs from guessing keyword relevance across massi
ViewT-Test Statistics Engine AI Connector
Run exact Student's, Welch's, and Paired t-tests local. Get CPU-guaranteed p-values instead of LLM-hallucinate
ViewMatrix Operations Engine AI Connector
Perform exact linear algebra — multiply, transpose, invert, and compute determinants of massive matrices local
ViewWolfram Alpha Solver AI Connector
Empower your AI with the world's most powerful computational engine. Solve complex calculus, extract exact sci
View
Suggestions
BPM Tap Tempo Analyzer AI Connector
Analyze tap-based rhythmic input to derive precise tempo, stability, and musical context.
ViewTempo Tap Averager AI Connector
Calculate precise BPM and rhythmic stability from tap timestamps.
ViewFraction Exact Calculator AI Connector
Perform exact rational number arithmetic, continued fraction analysis, and decimal expansion without floating-
ViewPrime Number Engine AI Connector
Advanced computational engine for primality testing, integer factorization, and prime distribution analysis.
View
