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
They converted linear algebra expressions into relational algebra expressions, optimized them using equality saturation and converted back into linear algebra. With some noticeable speedups.
They used relational algebra for optimization because relational algebra has canonical form - there is only one most optimal expression.
And, equality saturation is most efficiently implemented using generic join algorithm.
I noticed the cedardb.com blogpost on the project is slashdotted at the moment, but the game itself plays just fine.