← Back to context

Comment by Alive-in-2025

16 hours ago

Yes, this is fantastic! I'm trying it right now. I look forward to the day when LLM inferencing can be done in a sql query and take less than the age of the earth to do something. This works way better than I would have expected, since, well, it's sql all the way down.

I noticed the cedardb.com blogpost on the project is slashdotted at the moment, but the game itself plays just fine.

Off topic, but say you have a program that needs to calculate something but takes a long long time, how to counter hardware failure without needing to calculate everything from the start?

  • Typically you use redundant computations, which don't have to be done from the start. You could calculate intermediate values and check them before proceeding

I think you could do that already. Just store your weights in a table...

  • Matrix multiplication is after all nothing but an aggregate sum over a cross join.

    1. Write a query planner that compiles SQL into CUDA kernels

    2. Write a VRAM-resident backend for Postgres

    3. ???

    4. Profit!