frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Hurried Announcement: Alessandro Masullo GRH

https://math216.wordpress.com/2026/11/20/hurried-announcement-alessandro-masullo-grh/
1208•jasondavies•4h ago•564 comments

Inkling 2 Mini

https://thinkingmachines.ai/news/inkling-2-mini/
442•jasondavies•2h ago•67 comments

Levent Alpöge claims proof of the Generalized Riemann Hypothesis [pdf]

https://alpo.ge/remark.pdf
2198•iamronaldo•8h ago•1505 comments

We promoted developers into architects without informing them

https://manidoraisamy.com/developer-to-architect.html
216•QueensGambit•4h ago•128 comments

Unforced Navier-Stokes Singularity and the Generalized Riemann Hypothesis

https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singu...
267•archon1410•5h ago•84 comments

Language Models Can Rewrite Their Own Weights

https://arxiv.org/abs/2611.21885
307•lwhsiao•6h ago•101 comments

A few hours ago Google DeepMind created a math horizon repo

https://github.com/google-deepmind/math-horizon
24•RubenLtke•1h ago•4 comments

The stochastic parrots have apparently proved the Riemann Hypothesis

https://scottaaronson.blog/?p=10344
144•stratos123•2h ago•104 comments

Vibecoding an inference chip

https://ankitg.me/blog/vibecoding-inference-chip/
90•ankitvgupta•4h ago•28 comments

Finite-time blow-up for the Navier–Stokes equations

https://github.com/tristanbuckmaster/navier-stokes/
235•trotro•7h ago•76 comments

And Yet, It Moves

https://signoregalilei.com/2026/11/20/and-yet-it-moves/
44•notfried•2h ago•21 comments

DreamCoder: Coding harness and IDE from the author of Mastering Emacs

https://www.masteringemacs.org/article/announcing-dreamcoder
45•facundo_olano•2h ago•5 comments

If you can't explain something in simple terms, you don't understand it (2017)

https://kottke.org/17/06/if-you-cant-explain-something-in-simple-terms-you-dont-understand-it
590•sammatilda•13h ago•281 comments

Winedroid – run Android apps without Android (WASM demo)

https://winedroid.soham.sh/demo/
69•sohzm•3h ago•25 comments

Microsoft announces Windows Server 2028 with hardened security

https://www.bleepingcomputer.com/news/microsoft/microsoft-announces-windows-server-2028-with-hard...
53•N19PEDL2•2d ago•50 comments

Frostbite: A new CPU architecture discovered, designed and verified by AI

https://architectlabs.com/blog/frostbite
596•shioyama•12h ago•315 comments

Nvidia accounting under SEC investigation, sources say

https://finance.yahoo.com/markets/article/nvidia-stock-extends-25-trillion-rout-as-sec-probe-repo...
148•ftchd•2h ago•60 comments

Signal Is Serious About Protecting Your Privacy

https://signal.org/blog/protecting-your-privacy/
450•dotcoma•13h ago•283 comments

Show HN: An API for word timestamps from speech, 75% within 20ms

https://quebec.yarn.so
46•jasperstory•3d ago•5 comments

I'm Peter Roberts, immigration attorney who does work for YC and startups. AMA

89•proberts•6h ago•119 comments

Show HN: OpenComputer – an open source alternative to Devin

https://github.com/diggerhq/opencomputer
34•iacguy•2h ago•12 comments

Show HN: I made an audio-to-MIDI model 60x more efficient

https://kobi.music/research/dettato
215•hidude562•3d ago•47 comments

The Hungry Butler Effect: Concealed Commercial Incentives in LLMs

https://www.researchgate.net/publication/418143113_The_Hungry_Butler_Effect_Concealed_Commercial_...
3•undefinedmethod•28m ago•0 comments

Reverse Engineering my cat's litter box

https://master--ytulsiani.netlify.app/blog/furrytails/
18•allidoisvim•2h ago•7 comments

Running two PSP emulators on one Switch 2 and sharing one via GameShare

https://github.com/XITRIX/ppsspp-nx2/blob/master/SWITCH2-GAMESHARE.md
50•khalidkhair•5h ago•0 comments

Google Workers Tell Their Employer Not to Punish Schools That Don't Want AI

https://www.motherjones.com/politics/2026/11/google-alphabet-union-school-ai-protest-gemini-worke...
224•cdrnsf•5h ago•160 comments

The G1 Garbage Collector

https://dev.java/learn/jvm/tool/garbage-collection/g1gc-overview/
93•ejboy•3d ago•49 comments

Floppy3.5: A portable 3.5-inch floppy WiFi NAS

https://github.com/bigcrimping/floppy3.5
131•fortran77•1d ago•55 comments

PostgreSQL 19: A hands-on tour with runnable browser examples

https://certuvia.com/blog/postgres-19
38•petrpravda•5h ago•3 comments

LZ-RDO lands in ARM's astc-encoder

https://www.jonolick.com/home/lz-rdo-lands-in-arms-astc-encoder
14•dverlaeckt80•2d ago•0 comments
Open in hackernews

EM-LLM: Human-Inspired Episodic Memory for Infinite Context LLMs

https://github.com/em-llm/EM-LLM-model
113•jbotz•1y ago

Comments

MacsHeadroom•1y ago
So, infinite context length by making it compute bound instead of memory bound. Curious how much longer this takes to run and when it makes sense to use vs RAG.
zfountas•1y ago
Hi MacsHeadroom, first author here. Thanks for the great questions about compute/memory trade-offs.

The quick take: To give you an example of processing speed, with a 7B model on an NVIDIA V100, EM-LLM processes (or generates) about 326 tokens/sec with a 51.2K context window (which is quite competitive for these old GPUs).

More broadly, EM-LLM is designed to make ultra-long contexts (memory-prohibitive for standard O(n^2) attention) computationally tractable. The Appendix C of our paper https://openreview.net/pdf?id=BI2int5SAC details how: significantly better attention scaling, efficient O(nm) memory formation, and large KV cache management via CPU/disk offloading. While there's a slight per-chunk overhead compared to the simplest retrieval methods initially, the crucial part is our ability to handle sequences at scales infeasible for full-context models. For instance, we're successfully using 8B models with 10M token contexts on a single GPU without prohibitive delays.

Regarding RAG in particular, EM-LLM often shows significant gains on tasks needing deep understanding of a single, long, coherent context. A key reason is that EM-LLM allows each layer to retrieve and integrate relevant information from different "episodes" of the context independently, offering more nuance than a typical single RAG step, for similar overall resource use.

mountainriver•1y ago
TTT, cannon layers, and titans seem like a stronger approach IMO.

Information needs to be compressed into latent space or it becomes computationally intractable

searchguy•1y ago
do you have references to

> TTT, cannon layers, and titans

najarvg•1y ago
This was the nearest reference I could find. Links to an unofficial pytorch implementation on Github are also linked in the threads somewhere - https://www.reddit.com/r/LocalLLaMA/comments/1i0q8nw/titans_...
vessenes•1y ago
is titans replicated? I feel like lucidrains couldn't replicate.
logicchains•1y ago
I think something like Titans explains Gemini's excellent long context performance. That would explain why the Titan team hasn't released the training code or hyperpameters used even though they said in the paper that they would, and why soon after that it came out that DeepMind would be holding off publishing new results for 6 months to avoid giving away competitive advantages.
p_v_doom•1y ago
Interesting. Before there even was attention I was thinking that the episodic memory model offers something that could be very useful for neural nets, so its cool to see people testing that
killerstorm•1y ago
Note that this works within a single sequence of tokens. It might be consistent with "episodic memory" metaphor if we consider a particular transformer run as its experience.

But this might be very different from what people expect from "memory" - i.e. ability to learn vast amounts of information and retrieve it as necessary.

This is more like a refinement of transformer attention: instead of running attention over all tokens (which is very expensive as it's quadratic), it selects a subset of token spans and runs fine-grained attention only on those. So it essentially breaks transformer attention into two parts - coarse-grained (k-NN over token spans) and fine-grained (normal).

It might be a great thing for long-context situations. But it doesn't make sense when you want millions of different facts to be considered - making them into long context is rather inefficient.

yorwba•1y ago
It would be inefficient if you had to do it from scratch for every query, but if you can do it once as a preprocessing step and reuse the prepared context for many queries, it might start to become more efficient than a shorter context that includes only some documents but has to be reprocessed because it's different every time.
killerstorm•1y ago
Yes, I think it might be a good solution where you have a context up to 10M of tokens and you do a lot of requests with that context. It might be relevant for agentic stuff which tends to produce long chat logs - especially with some gadgets on top, e.g. some 'episodes' might be completely removed as obsolete.

But I don't think it's a good solution for bigger amounts of data - as in that case it's more beneficial if that can be formed into independent memories.