Shift Registers Shape Sound Worlds

Listen to the output first: 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0… These aren’t random numbers—they’re the heartbeat of generative music, produced by one of computing’s most elegant algorithms.

The Linear Feedback Shift Register transforms a handful of bits into seemingly endless variation. Start with any non-zero pattern, tap specific positions, XOR them together, and shift everything left. The magic lies in choosing the right taps: with just 16 bits and the correct feedback polynomial, you get 65,535 unique states before repetition.

def lfsr_16bit(seed=0b0100000011001001):
    state = seed
    while True:
        # Taps at positions 16, 14, 13, 11 (maximal length)
        feedback = ((state >> 15) ^ (state >> 13) ^ 
                   (state >> 12) ^ (state >> 10)) & 1
        state = ((state << 1) | feedback) & 0xFFFF
        yield state & 1  # Output the LSB

stream = lfsr_16bit()
print(", ".join(str(next(stream)) for _ in range(15)))

Zig strips away the ceremony, revealing the raw bit manipulation that made 1980s sound chips sing:

fn lfsr16(state: *u16) u1 {
    const feedback = (state.* >> 15) ^ (state.* >> 13) ^ 
                    (state.* >> 12) ^ (state.* >> 10);
    state.* = (state.* << 1) | (feedback & 1);
    return @truncate(state.* & 1);
}

In generative soundscapes, this predictable chaos becomes rhythm, melody, and texture. The LFSR’s periodic nature creates musical patterns that feel both structured and surprising—exactly what composers want when crafting evolving sonic environments. Each bit becomes a trigger: sample playback, filter cutoff, reverb send. The Commodore 64’s SID chip used similar techniques, proving that mathematical elegance often sounds better than true randomness.

The beauty isn’t just in the output—it’s in the feedback loop itself, where yesterday’s state shapes tomorrow’s music.