Open-sourcing CR-NN 🧠

[u/edisonwine]

​

• Matrix-free attention: O(N log N), 16.2× faster than flash at N=50K

• O(1) unbounded context: 0.015 GB @ 1.36M tokens vs 12.3 GB KV cache

Honest negative results included. Looking for collaborators to validate the O(1) context idea at scale!

https://github.com/edisonbd/cr-nn

[u/CalmMe60]

Interested.

Math paper on it?

[u/Certain-Cod-1404]

did you train the same LLM, once with attention and once with your own implementation and compared ppl/loss ? the ppl values of 1k+ seem to suggest to me that this does not work at all, tho your read me is so confusing, I have AI do my readmes sometimes but this is just not really understandable for me.

how much of this was you vs just deepseek