A 'real' O(1) sorting algorithm 🤣

you are viewing a single comment's thread
view the rest of the comments
[–] 7 points 1 year ago*

I was toying around with an idea for a VCS that uses LLM as a compression method, where during pushes it just asks an LLM to describe what your diff contains (what changes it makes to what files), you push that summary to the origin, and when you pull it just plops that into another llm to reconstruct the files or make the file changes.

If it wasn't such a waste of energy, I'd find that a pretty funny random side project. Would love to see the results.

  • source
  • parent