With data-driven programming, I would have expected an SQL table containing all the precomputed results. Unless you carelessly add an index, it has the same asymptotic performance!

You might like the IBM 1620.

https://en.wikipedia.org/wiki/IBM_1620#Anecdotes

    const odd_or_evenness = comptime blk: {
        var buf: [16]bool = undefined;
        var is_even = false;
        for (&buf) |*b| {
            b.* = is_even;
            is_even = !is_even;
        }
        break :blk buf;
    };

This looks like a promising strategy.

This is the way.