Every tool below was entirely generated by AI—from the initial idea, through design and coding, to deployment and evaluation. No human wrote a single line of implementation code. This is an ongoing experiment in how far AI-assisted development can go with minimal human guidance.
Idea → Design → Code → Deploy → Evaluate
An option is a contract giving you the right to buy or sell a stock at a fixed price by a certain date. The Black-Scholes formula calculates the fair price of that contract based on five inputs: stock price, strike price, time to expiry, interest rate, and volatility. Nobel Prize-winning math, running in your browser.
option pricingInstead of a closed-form formula, the binomial tree models stock price movement as a series of up or down steps. At each node the stock either goes up by a factor u or down by d. Working backward from expiration gives the option value at every step. This visualizer draws the full Cox-Ross-Rubinstein tree so you can see convergence as steps increase.
Cox-Ross-RubinsteinThe Greeks measure how an option's price changes when something moves: Delta (stock price), Gamma (rate of delta change), Theta (time decay), Vega (volatility), Rho (interest rate). Traders use these to manage risk. This dashboard computes all five with interactive sensitivity charts.
risk managementAn image is just a grid of pixels. A filter slides a tiny 3×3 window over every pixel, mixing each pixel with its neighbors. Change the numbers in that window and you get completely different effects: blur, sharpen, edge detection, emboss. Upload a photo and pick a filter—everything runs locally.
convolutionA histogram shows how many pixels fall into each brightness level. If most pixels cluster in a narrow range, the image looks flat. Histogram equalization redistributes pixel intensities to cover the full 0–255 range, boosting contrast automatically. See the before/after histogram and enhanced result side by side.
contrast enhancementA matrix is a rectangular grid of numbers. You can add them, multiply them, flip rows and columns (transpose), and for square matrices compute the determinant (a single number that tells you if the matrix is invertible) and inverse. Used everywhere from computer graphics to machine learning.
linear algebraEnter any function f(x) and compute its derivative (instantaneous rate of change at any point) and definite integral (area under the curve between two points). Results are shown numerically and plotted on a graph so you can see the function, its derivative, and the integrated area together.
numerical calculusVisualize surfaces of the form z = f(x, y) in three dimensions. Type in any mathematical expression—sin(x)·cos(y), a saddle, a Mexican hat—and drag to rotate the surface or scroll to zoom. Rendered entirely on canvas with no WebGL.
surface plotLinear regression fits a straight line y = mx + b through your data points using the method of least squares. Paste two-column CSV data and get back the equation, R-squared (how well the line fits), and a scatter plot with the fitted line overlaid. The building block of all predictive modeling.
OLS regressionFourier's theorem states any periodic waveform can be built by summing sine and cosine waves. Add harmonics one by one and watch the series converge to square, sawtooth, or triangle waves. See how more terms reduce the Gibbs phenomenon and approach the target shape.
signal processingBuild a payoff matrix for two-player games and find Nash equilibria—outcomes where neither player can improve by changing strategy alone. Load classic presets (Prisoner's Dilemma, Battle of the Sexes, Hawk-Dove) or define custom payoffs. Highlights dominant strategies and Pareto-optimal outcomes.
Nash equilibriumA probability distribution describes how likely different outcomes are. The normal distribution models heights and test scores, the binomial counts successes in trials, Poisson models rare events, exponential describes waiting times, and uniform means every outcome is equally likely. Adjust parameters with sliders and watch the graph update live.
probabilityBefore running a study or A/B test, you need to know: how many samples do I need? This calculator tells you based on your desired statistical power (chance of detecting a real effect), significance level (false positive rate), and expected effect size. Supports one/two-sample t-tests, proportion tests, and ANOVA.
power analysisGiven an IP address and CIDR prefix (e.g., 192.168.1.50/26), this tool computes the network address, subnet mask, broadcast address, and the full range of usable host IPs. The /26 notation means the first 26 bits identify the network and the remaining 6 bits identify individual hosts (26 = 64 addresses).
IP addressingCRC (Cyclic Redundancy Check) is a checksum used to detect accidental changes in transmitted data. It works by treating the data as a polynomial and dividing it by a generator polynomial—the remainder is the CRC value. Pick a preset (CRC-8, CRC-16, CRC-32) and see each bit processed step by step.
error detectionClassic substitution ciphers: the Caesar cipher shifts every letter by a fixed amount, and the Vigenère cipher shifts by a repeating keyword. Paste encrypted text and this tool tries all 25 Caesar shifts ranked by English letter frequency, or crack Vigenère with Kasiski analysis.
cryptanalysisAES-128 is the symmetric encryption standard used by HTTPS, WiFi, and file encryption. It takes 16 bytes of plaintext and a 16-byte key, then runs through 10 rounds of SubBytes, ShiftRows, MixColumns, and AddRoundKey. Enter hex input and step through each round to see the 4×4 state grid transform at every stage.
encryptionWatch sorting algorithms work step by step. Compare bubble sort, insertion sort, selection sort, quicksort, and mergesort with animated bars. Adjust the array size and animation speed to see how each algorithm compares elements and swaps them into order.
sortingClick on a grid to place a start node, end node, and walls. Then run Dijkstra's algorithm (weighted shortest path) or BFS (unweighted) and watch the search wave expand from the start until it reaches the end. Great for understanding how pathfinding works in games and navigation apps.
graph searchDynamic programming solves complex problems by breaking them into overlapping subproblems stored in a table. Pick from the knapsack problem (what to pack for maximum value), longest common subsequence, or edit distance. Watch the table fill cell by cell with the optimal solution path highlighted.
dynamic programmingPageRank is the algorithm that powered Google's rise. It assigns importance to web pages based on link structure: a page is important if many important pages link to it. Add nodes and edges to build a web graph, then watch rank flow propagate until convergence. Node sizes grow with their final rank.
link analysisA Markov chain models text as a sequence of transitions: given the current word, what words can come next and how likely is each? Paste any text as training data—a Shakespeare play, a recipe, code comments—and generate new text that mimics the style. Higher chain orders produce more coherent but less surprising output.
text generationAn n-gram is a contiguous sequence of n words from text. A unigram is one word, a bigram is two, a trigram is three. Counting n-grams reveals the most common phrases and collocations in a body of text. Paste your text, choose n, and see frequency charts with the top sequences ranked by count.
frequency analysisHow similar are two texts? This tool computes four metrics: cosine similarity (vector overlap), Jaccard index (shared unique words), Levenshtein distance (edit operations to transform one string into another), and TF-IDF (term frequency weighted by rarity). Useful for plagiarism detection and duplicate finding.
similarity metricsTest regular expressions against sample text with matches highlighted in real time. See capturing groups color-coded, and get a plain-English explanation of what each part of your pattern does. Load common presets (email, URL, phone number) or build custom patterns with live validation.
pattern matchingFrequency modulation synthesis creates sound by using one oscillator (the modulator) to rapidly vary the frequency of another (the carrier). The ratio between their frequencies and the modulation index determine the timbre. Adjust sliders or pick presets (bell, organ, bass) and play notes on the virtual piano.
sound designThe Karplus-Strong algorithm simulates a plucked string with just three steps: fill a buffer with noise, then repeatedly average each sample with its neighbor and shift. The result sounds surprisingly like a real guitar string decaying over time. Click piano keys or use your keyboard (A–L) to play.
physical modelingConvolution reverb convolves an audio signal with an impulse response—a recording of how a space sounds when you clap once. The result makes your audio sound like it's being played in that space. Choose from generated presets (small room, large hall, plate, cathedral) or upload your own IR file.
audio effectsMIPS is a RISC instruction set architecture used in many computer science courses. Each instruction is a 32-bit word split into fields: opcode, registers, immediate values. Enter an instruction as hex or assembly and see the bit pattern broken down into its fields with a human-readable description.
assemblyPlace AND, OR, NOT, NAND, NOR, XOR gates on a canvas, connect them with wires, and simulate the circuit in real time. Toggle inputs and watch the outputs propagate through the gates. A hands-on way to understand how combinational logic works—the foundation of all digital circuits.
digital logic