Fibbonacci series

Fibbonacci series

Move the param up or down to get the nth position in the series

By Beestonian Created: April 12, 2026
Long LFO modulator

Long LFO modulator

Use this to conveniently modulate LFO's with extremely long cycles.

By Beestonian Created: April 11, 2026
Tilt Filter

Tilt Filter

just lets you add bass or brightness to a sound

By Beestonian Created: April 11, 2026
Track 02

Track 02

TOKEN - S02 - E01 - TRACK 02

By sitesregister Created: April 8, 2026
Envelope Randomizer

Envelope Randomizer

produces random enveloptions

By Beestonian Created: April 8, 2026
Harmonic Superfilter Bank

Harmonic Superfilter Bank

By Beestonian Created: April 7, 2026
Funky worm

Funky worm

Continuous sawtooth wave with filter.

By Beestonian Created: April 6, 2026
Buchla folding II

Buchla folding II

Buchla Folding 2 A wavefolder using modular arithmetic to reflect a signal at variable boundaries, producing infinite folding stages without discrete stage limits. Inputs Input (audio): Signal to fold. Drive (1–32): Multiplies the input amplitude before folding. Higher values = more folds. Threshold (0–2): Sets the reflection boundaries at ±T/2. Lower values fold more aggressively at the same drive level and reduce the output amplitude range. Output Folded audio signal, bounded to ±Threshold/2. Usage Drive and Threshold both increase fold density but interact differently. Drive pushes the signal harder into the folding boundaries. Threshold moves the boundaries closer to zero, which also increases fold count but simultaneously compresses the output range. For classic Buchla-style folding, set Threshold to 2 (boundaries at ±1) and sweep Drive. For more extreme timbres, lower Threshold while keeping Drive moderate.

By Beestonian Created: April 6, 2026
Modulo III

Modulo III

**Euclidean Modulo** Divides a dividend by a divisor and returns two outputs: the remainder (always non-negative) and the quotient (the number of whole times the divisor fits into the dividend, floored toward negative infinity). **Inputs** - Input 1: Dividend (the number being divided) - Input 2: Divisor (the number to divide by) **Outputs** - Output 1: Quotient (floor of dividend ÷ divisor) - Output 2: Remainder (always in the range 0 to divisor-1) **How it works internally** The core is a truncating division: dividend × (1/divisor), then floor via subtracting the fractional part. This gives a truncation remainder (dividend - quotient × divisor), which can be negative when the dividend is negative. The Euclidean correction negates the truncation remainder and feeds it through GreaterThanZero. If the remainder was negative, the negated value is positive, GreaterThanZero outputs 1, and the divisor is added back to bring the remainder into the non-negative range. If the remainder was zero or positive, nothing happens. **Usage examples** Scale degree wrapping: with divisor 7, an input of 15 returns quotient 2 (octave) and remainder 1 (scale degree). An input of -1 returns quotient -1 and remainder 6 (wraps around rather than going negative). Phase wrapping, buffer looping, or any situation where you need a value to stay within a fixed non-negative range regardless of the sign of the input. **Note**: divisor must be non-zero. A divisor of zero will cause a division-by-zero through the OnePerX node.

By Beestonian Created: April 5, 2026
Atan2

Atan2

Do not ask me how this works, but pair it with the hilbert analyzer node.

By Beestonian Created: April 4, 2026
Dispersion delay

Dispersion delay

Delays different frequencies according to a pitch ratio.

By Beestonian Created: April 3, 2026
Queen Pitch testing

Queen Pitch testing

By robbinhj10 Created: April 3, 2026