frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Our position on open-weights models

https://www.anthropic.com/news/position-open-weights-models
476•surprisetalk•4h ago•661 comments

Benchmarking Opus 5 on SlopCodeBench

https://github.com/humanlayer/advanced-context-engineering-for-coding-agents/blob/main/benchmarki...
135•dhorthy•3h ago•32 comments

Astronauts describe persistent 'observer' sensation after 6 month missions

https://spacedaily.com/sd-v-astronauts-returning-from-six-month-missions-describe-a-persistent-ob...
67•zdw•2h ago•24 comments

DConf 2026 in London

https://dconf.org/2026/index.html
47•teleforce•3h ago•18 comments

Watching Go's new garbage collector move through the heap

https://theconsensus.dev/p/2026/07/19/observing-gos-garbage-collector-old-and-new.html
176•matheusmoreira•2d ago•17 comments

C/C++ projects packaged for Zig

https://github.com/allyourcodebase
30•jcbhmr•3h ago•21 comments

RTX 2080 Ti Memory Upgrade to 22 GB

https://gpusolutions.net/rbservices/graphics-card-upgrade/
18•wslh•3d ago•13 comments

The Burau representation of the braid group is faithful for n = 4

https://arxiv.org/abs/2607.05283
17•wglb•2h ago•5 comments

Three Theses on the Literacy Crisis

https://trevoraleo.substack.com/p/three-theses-on-the-literacy-crisis
16•samclemens•2d ago•7 comments

Launch HN: Rise Reforming (YC S26) – Turning Waste Gases into Valuable Chemicals

https://www.rise-reforming.com
60•george_rose25•6h ago•22 comments

Self-contained highly-portable Python distributions

https://gregoryszorc.com/docs/python-build-standalone/main/
116•jcbhmr•7h ago•23 comments

Glue bonds to nonstick surfaces and wipes clean with ethanol

https://cen.acs.org/materials/adhesives/glue-bonds-nonstick-surfaces-wipes-clean/104/web/2026/07
152•gmays•4d ago•89 comments

Securing Services with Rootless Containers

https://blog.coderspirit.xyz/blog/2026/07/06/securing-services-with-rootless-containers/
65•speckx•4d ago•21 comments

Hard Road – A beautiful procedural post-apocalyptic game

https://hardroad.xyz/
32•getbutterfly•3h ago•12 comments

Ray tracing massive amounts of animated geometry using tetrahedral cages

https://gpuopen.com/learn/ray-tracing-massive-amounts-animated-geometry/
72•LorenDB•4d ago•10 comments

Kimi K3 Now Available via Telnyx Inference API

https://telnyx.com/release-notes/kimi-k3-telnyx-inference
18•fionaattelnyx•3h ago•5 comments

Removing React.js from the codebase and adapting Htmx for UI interactivity (2023)

https://misago-project.org/t/removing-reactjs-from-the-codebase-and-adapting-htmx-for-ui-interact...
235•Ralfp•16h ago•161 comments

A missing underscore sent innocent man to prison for 18 months

https://arstechnica.com/tech-policy/2026/07/police-missed-one-underscore-and-sent-the-wrong-man-t...
150•quantified•4h ago•76 comments

Show HN: Yap – OSS on-device voice dictation for macOS with no model to download

https://github.com/FrigadeHQ/yap
8•pancomplex•7h ago•0 comments

Exploiting Volvo/Eicher's fleet platform to gain control over all users/vehicles

https://eaton-works.com/2026/07/27/my-eicher-hack/
136•EatonZ•11h ago•44 comments

The computer that helped win World War II

https://spectrum.ieee.org/colossus-computer-ieee-milestone
176•baruchel•5d ago•72 comments

Paged Out #9 [pdf]

https://pagedout.institute/download/PagedOut_009.pdf
180•laurensr•11h ago•22 comments

Judge Rejects Google's Attempt to DMCA Its Way Out of Being Scraped

https://www.techdirt.com/2026/07/27/judge-rejects-googles-attempt-to-dmca-its-way-out-of-being-sc...
265•cdrnsf•8h ago•103 comments

UpCodes (YC S17) is hiring remote AE's to help make buildings cheaper

https://up.codes/careers?utm_source=HN
1•Old_Thrashbarg•9h ago

Show HN: FeyNoBg – Automatic background removal model and training library

https://usefeyn.com/blog/feynobg/
91•snyy•9h ago•21 comments

Libsm64: Mario 64 as a library for use in external game engines

https://github.com/libsm64/libsm64
186•klaussilveira•16h ago•21 comments

Show HN: Trylle – The Next-Gen Git Platform for Modern Teams

https://trylle.com/home
6•Xlab•2h ago•1 comments

Forth

https://xkcd.com/3277/
126•beardyw•5h ago•26 comments

MAI-Cyber-1-Flash inside MDASH

https://microsoft.ai/news/introducing-mai-cyber-1-flash-inside-mdash/
218•migmartri•9h ago•108 comments

Bytecode-to-Source Mapping

https://tidefield.dev/bytecode-to-source-mapping/
38•evakhoury•7h ago•2 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.