frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Novo Nordisk's Canadian Mistake

https://www.science.org/content/blog-post/novo-nordisk-s-canadian-mistake
281•jbm•7h ago•134 comments

Forth: The programming language that writes itself

https://ratfactor.com/forth/the_programming_language_that_writes_itself.html
54•suioir•3h ago•18 comments

Doing well in your courses: Andrej's advice for success (2013)

https://cs.stanford.edu/people/karpathy/advice.html
428•peterkshultz•11h ago•140 comments

Introduction to reverse-engineering vintage synth firmware

https://ajxs.me/blog/Introduction_to_Reverse-Engineering_Vintage_Synth_Firmware.html
9•jmillikin•57m ago•0 comments

Duke Nukem: Zero Hour N64 ROM Reverse-Engineering Project Hits 100%

https://github.com/Gillou68310/DukeNukemZeroHour
98•birdculture•6h ago•38 comments

QuickDrawViewer: A Mac OS X utility to visualise QuickDraw (PICT) files

https://github.com/wiesmann/QuickDrawViewer
36•ibobev•4h ago•12 comments

Gleam OTP – Fault Tolerant Multicore Programs with Actors

https://github.com/gleam-lang/otp
59•TheWiggles•5h ago•21 comments

Airliner hit by possible space debris

https://avbrief.com/united-max-hit-by-falling-object-at-36000-feet/
240•d_silin•9h ago•124 comments

Dosbian: Boot to DOSBox on Raspberry Pi

https://cmaiolino.wordpress.com/dosbian/
109•indigodaddy•8h ago•44 comments

What's Behind the Mysterious Ancient Wall in the Gobi Desert?

https://news.artnet.com/art-world/the-hunt-gobi-wall-mongolia-2674588
28•derbOac•1w ago•12 comments

Oskar Speck's 1932 Kayak Journey from Germany to Australia

https://nswskc.wordpress.com/2002/10/24/incredible-journey-50/
14•dividendpayee•1w ago•0 comments

Compare Single Board Computers

https://sbc.compare/
121•todsacerdoti•9h ago•50 comments

GNU Octave Meets JupyterLite: Compute Anywhere, Anytime

https://blog.jupyter.org/gnu-octave-meets-jupyterlite-compute-anywhere-anytime-8b033afbbcdc
114•bauta-steen•12h ago•32 comments

From Hollywood to horticulture: Cate Blanchett on a mission to save seeds

https://www.bbc.com/news/articles/cwy7ekl4yl8o
22•RickJWagner•3h ago•2 comments

Nvidia has produced the first Blackwell wafer on US soil

https://www.xda-developers.com/nvidia-produced-first-blackwell-wafer-us-soil/
27•kristianp•1h ago•5 comments

Look at how unhinged GPU box art was in the 2000s

https://www.xda-developers.com/absolutely-unhinged-gpu-box-art-from-the-early-2000s/
72•m-hodges•2h ago•33 comments

Deterministic multithreading is hard (2024)

https://www.factorio.com/blog/post/fff-415
68•adtac•18h ago•7 comments

The Spilhaus Projection: A world map according to fish

https://southernwoodenboatsailing.com/news/the-spilhaus-projection-a-world-map-according-to-fish
102•zynovex•1w ago•14 comments

Discussion of the Benefits and Drawbacks of the Git Pre-Commit Hook

https://yeldirium.de/2025/10/09/pre-commit-hooks/index.html
6•hambes•1w ago•1 comments

Comparing the power consumption of a 30 year old refrigerator to a new one

https://ounapuu.ee/posts/2025/10/14/fridge-power-consumption/
132•furkansahin•5d ago•170 comments

LoC Is a Dumb Metric for Functions

https://theaxolot.wordpress.com/2025/10/18/loc-is-a-dumb-metric-for-functions/
15•Axol•4h ago•18 comments

The Cancer Imaging Archive (TCIA)

https://www.cancerimagingarchive.net/
40•1970-01-01•6d ago•3 comments

Replua.nvim – an Emacs-style scratch buffer for executing Lua

https://github.com/mghaight/replua.nvim
14•mghaig•5h ago•1 comments

The working-class hero of Bletchley Park you didn't see in the movies

https://www.theguardian.com/world/2025/oct/12/move-over-alan-turing-meet-the-working-class-hero-o...
97•hansmayer•1w ago•49 comments

Could the XZ backdoor been detected with better Git/Deb packaging practices?

https://optimizedbyotto.com/post/xz-backdoor-debian-git-detection/
83•ottoke•10h ago•68 comments

Infisical (YC W23) Is Hiring Full Stack Engineers

https://www.ycombinator.com/companies/infisical/jobs/0gY2Da1-full-stack-engineer-global
1•vmatsiiako•10h ago

Pawn is a simple, typeless, 32-bit extension language with a C-like syntax

https://www.compuphase.com/pawn/pawn.htm
12•unleaded•1w ago•3 comments

The macOS LC_COLLATE hunt: Or why does sort order differently on macOS and Linux (2020)

https://blog.zhimingwang.org/macos-lc_collate-hunt
80•g0xA52A2A•14h ago•16 comments

Show HN: Duck-UI – Browser-Based SQL IDE for DuckDB

https://demo.duckui.com
183•caioricciuti•16h ago•56 comments

Original C64 Lode Runner Source Code

https://github.com/Piddewitt/Loderunner
67•indigodaddy•5h ago•24 comments
Open in hackernews

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

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

Comments

MacsHeadroom•5mo 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•5mo 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•5mo 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•5mo ago
do you have references to

> TTT, cannon layers, and titans

najarvg•5mo 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•5mo ago
is titans replicated? I feel like lucidrains couldn't replicate.
logicchains•5mo 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•5mo 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•5mo 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•5mo 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•5mo 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.