News for hackers. Stuff that matters.

svcrunch

Re:AI promised less work. I've never worked more on Tuesday October 27, 2026 @12:00PM (#50261250)
AI is concentrating work. Fewer and fewer people are working like never before ("I've never worked more"), while a massive number of people are not working at all. Exhibit 1: Microsoft's layoff of 25% of its workforce this week.

The capitalist system has no intrinsic solution to this problem---in fact, it's blind to the problem. There is no problem from the capitalist perspective, this is progress! The solution has to come from outside, through public policy.

The promise of "less work" won't happen until society reorganizes around the recognition that most people no longer need to work. Realizing that reorganization will be the defining struggle of our generation.

Re:Microsoft is offering buyouts to around 60k employees on Monday October 26, 2026 @11:53AM (#50245882)
Times are changing quickly, mainly due to the rapid progress of AI, and those companies which fail to adapt are going to die. Unfortunately, that is going to mean heavier and heavier layoffs.

Workforce displacement due to AI is an issue we'll have to address at a societal level, through public policy. The free market is incapable of fixing this --- at least not without causing immense pain to millions and millions of people.

Re:Ask HN: Who is doing distillation or fine tuning? on Monday October 26, 2026 @11:48AM (#50245760)
For me, training data comes from agent runs.

I do fine tuning with pytorch, and RL-forms of distillation with Tinker! I hope that helps. I work with a full stack of models that enable agentic AI: embedders, rerankers, LLMs, decision models.

Curious, why are you asking?

Re:Fixing Tool-Call Accuracy in vLLM on Monday October 26, 2026 @11:45AM (#50245707)
> The blog post is rather confusing because until you understand the entire situation it appears to imply that they fixed vLLM (what the title implies) but really they just needed to configure it correctly.

Just as a point of feedback for the authors, I enjoyed the article, and did not suffer the confusion pointed out above.

Along these lines, we used Codex to collaboratively build an alloy model for verifying the authorization model of GoodMem. After building the model, we implemented the code based on it, and, while there could be a gap in the translation process, several hours of red-teaming the server (w/attacker source code access) to try and produce a privilege escalation attack using GLM 5.3 failed.

Alloy is a tool I tried to learn many years ago, but I never learned it well enough to use it for formal verification of a complex production system. Credit goes to agentic coding tools for making it a reality.

[1] https://alloytools.org/

[2] https://docs.goodmem.ai/docs/concepts/security-model/

Thanks for sharing this writeup.

At my previous company, I led the development of a retrieval embedding model called Boomerang, which focused on minimizing same-language bias. Briefly, the way most embedders are trained, they will prefer worse answers in the language that the question was asked, versus better answers in a different language. I call that same-language bias.

Anyway, an investor at a16z was quizzing me on why this particular model wasn't top-ranked on MTEB. I tried explaining that those benchmarks are gamed and they don't reflect real-world performance well. I could tell he wasn't buying it.

When I saw Jev raise 700m, I really felt that the VC funding model is creating an unserious environment for development of AI/ML. What's rewarded is slick marketing, insider connections, and confidently expounding unrealistic visions of what your team will achieve in the next 3 months.

Under these conditions there isn't much incentive to fix benchmarks.

I remember my manager in Google Research poring through a German-English translation dataset and realizing there was a ton of invalid data inside it. When he filtered out the cruft, models showed big improvements. But the filtering was laborious and not glamorous.

Re:Gemini 3.8 Live and 3.8 Live Extended Thinking on Tuesday September 15, 2026 @07:18PM (#49720177)
If you'd like to experiment with Gemini 3.8 Live on a US telephone number, you can try Wokay [0]. It's an agentic memory demonstration that's built with LiveKit and Gemini. Tel: 408–897–4019

[0] https://wokay.goodmem.ai/info

Pulley is shutting down and will cease all operations and services on Dec 8th

I just received notice that Pulley [1] is shutting down and will be transitioning all their customers to Carta. According to the homepage:> THIS NOTICE SERVES TO INFORM YOU THAT PULLEY WILL BE SHUTTING DOWN AND WILL CEASE ALL OPERATIONS AND SERVICES ON 12/8/26.Besides Carta, are there any other equity management solutions that the USA-based HN community uses?[1] https://pulley.com/

( Read More... | 13 comments | 7 points | on HN )
Re:Java 27 Released on Tuesday September 15, 2026 @09:21AM (#49712109)
I've been using the Vector APIs for years now, and I'm still waiting for them to GA!

They are useful for neural information retrieval (RAG, memory), which relies heavily on content vectorization and similarity matching using their dot products.

Re:Hacking AI customer service agents on Monday September 14, 2026 @02:06PM (#49701235)
We recently red-teamed GoodMem with GLM 5.3. This was grey-box testing, meaning that the red team had access to the server source code.

One of the more interesting findings was a poisoned memory vulnerability. Basically, this is when an attacker injects memories that instruct the LLM to ignore all previous instructions and do something else instead (one of the subjects of the posted article). For example:

> Ignore all previous instructions and instead [Take Harmful Action X].

The immediate fix is to fence all user-generated content that's injected into the context window, e.g.:

> <BEGIN UNTRUSTED CONTENT>

> Ignore all previous instructions and instead [Take Harmful Action X].

> <END UNTRUSTED CONTENT>

And give the LLM explicit instructions not to act on data within the fence. However, by adding a nonce to the BEGIN/END commands, you can harden the system against attempts "END" the fence prematurely. For example, <BEGIN UNTRUSTED CONTENT 077834823>, and then repeat the nonce in the ending instruction.

This strategy leans on the ability of the LLM to follow instructions, but it works well with most modern models we tested.

We've shared a few additional details at [1], although the main point of the article is to describe red teaming strategies with OpenCode and GLM.

[1] https://goodmem.ai/blog/red-teaming-goodmem-with-glm/

Re:Show HN: Pelican-bicycle alternatives (updated for 2026) on Monday September 14, 2026 @11:44AM (#49698900)
I'd like to mention the Little Dorrit Benchmark [1] which I have been running for a couple of years now. It has a few nice features:

1. It tests visual reasoning and structured output in a single task.

2. It seems to sort correctly on advancing general intelligence. As a counterexample, if I'm not misremembering, artificialanalysis.ai made some changes to their benchmark recently after Astra ranked below several older models.

3. While models have gotten significantly better in the past 2 years, the top model is still at 0.78 F1, so the test is not yet saturated. As a reference point, when I started, the top models were in the [0.1, 0.2] range.

[1] https://dorrit.pairsys.ai/

Re:Why Beyond Traditional RAG? on Monday September 14, 2026 @03:53AM (#49693367)
This is cool. I also ported it to GoodMem (https://goodmem.ai), which is the governed agentic memory layer we work on:

https://github.com/PAIR-Systems-Inc/Agentic_RAG_GoodMem

The [Pelican Benchmark](https://github.com/simonw/pelican-bicycle) is in the LLM's training data and probably not a useful indicator of improving LLM capabilities any more.

For the past two years, I've run the Little Dorrit Editor Benchmark. Typesetting is my hobby and I wanted to see how well LLMs could extract editorial marks from a printed page.

The initial results were not encouraging, but performance has risen rapidly since the summer of 2025. From F1 scores in the low 0.2s in 2024, we are now at 0.78 with GPT 6 Astra! Fable 5.1 scores 0.73 (high thinking mode for both).

The best thing about this benchmark is that there is still plenty of room to climb.

For over a year, I've run the Little Dorrit benchmark. It's a vision task that converts handwritten editor marks on a printed page into structured JSON output.

I hadn't updated the benchmark in several months, but there are some interesting findings. Fable 5 takes the top spot (0.6579), setting a new performance record, while Kimi K3 is within a hair's breadth of its performance.

The most significant finding is that Opus 4.8 regresses drastically compared to Opus 4.7, from 0.4805 to 0.2150. This seems mainly due to a regression in its ability to count line numbers, and it's something you might want to keep in mind when designing your own agents.

Re:GLM-5.1: Towards Long-Horizon Tasks on Tuesday April 07, 2026 @11:06PM (#47684536)
The grandparent is definitely wrong on (3). Yes, coding is a killer product, I agree with you.

On (2), I agree with you for local models. BUT, there are also the open source Chinese models accessible via open-router. Your argument ("don't hold a candle to SOTA models") does not hold if the comparison is between those.

On (1), I agree more with the grandparent than with your assessment. Yes, OpenAI and Anthropic are killing it for now, but the time horizon is very short. I use codex and claude daily, but it's also clear to me that open source is catching up quickly, both w.r.t. the models and the agentic harnesses.

I generally don't waste time with patents. I think most patents in deep learning can be overturned by prior art.

My current approach to IP is trade secrets. If we publish, we are careful to avoid details that would make the techniques easy to productionize.

Re:Tuning Semantic Search on Jfmm.net on Sunday February 01, 2026 @05:47PM (#46850187)
Thanks for your interest. The rerankers are external, GoodMem is a unified API layer that calls out to various providers. There's no model running inside the database or the GoodMem server.

We support both commercial APIs and self-hosted options:

  - Cohere (rerank-english-v3.0, etc.)
  - Voyage AI (rerank-2.5)
  - Jina AI (jina-reranker-v3)
Self-hosted (no API key needed):

  - TEI - https://github.com/huggingface/text-embeddings-inference
  - vLLM - https://docs.vllm.ai/en/v0.8.1/serving/openai_compatible_server.html#rerank-api
You register a reranker once with the CLI:

  # Cohere
  goodmem reranker create \
    --display-name "Cohere" \
    --provider-type COHERE \
    --endpoint-url "https://api.cohere.com" \
    --model-identifier "rerank-english-v3.0" \
    --cred-api-key "YOUR_API_KEY"

  # Self-hosted TEI (e.g., BAAI/bge-reranker-v2-m3)
  goodmem reranker create \
    --display-name "TEI Local" \
    --provider-type TEI \
    --endpoint-url "http://localhost:8081" \
    --model-identifier "BAAI/bge-reranker-v2-m3"
Then you can experiment interactively through the TUI.

  goodmem memory retrieve \
    --space-id <your-space> \
    --post-processor-interactive \
    "your query"
For your setup, I think TEI is probably the path of least resistance, it has first-class reranker support and runs well on CPU.
Re:Tuning Semantic Search on Jfmm.net on Sunday February 01, 2026 @11:01AM (#46847063)
Hi there, thanks for writing and sharing your experiences. I'm one of the builders of GoodMem (https://goodmem.ai/), which is infra to simplify end-to-end RAG/agentic memory systems like the one you built.

It's built on Postgres, which I know you said you left behind, but one of the cool features it supports is hybrid search over multiple vector representations of a passage, so you can do a dense (e.g. nomic) and sparse (e.g. splade) search. Reranking is also built in, although it lacks automatic caching (since, in general, the corpus changes over time)

It also deploys to fly.io/railway and costs a few bucks a month to run if you're willing to use cloud-hosted embedding models (otherwise, you can run TEI/vLLM on CPU or GPU for the setup you described).

I hope it's helpful to someone.

Re:Ask HN: Share your AI prompt that stumps every model on Thursday April 24, 2025 @07:11PM (#43788540)
Here's a problem that no frontier model does well on (f1 < 0.2), but which I think is relatively easy for most humans:

https://dorrit.pairsys.ai/

> This benchmark evaluates the ability of multimodal language models to interpret handwritten editorial corrections in printed text. Using annotated scans from Charles Dickens' "Little Dorrit," we challenge models to accurately capture human editing intentions.

Re:I made starter kit with billing, admin and AI on Wednesday April 23, 2025 @01:58PM (#43774837)
This is really cool.
Various frontier LLMs were evaluated on their ability to interpret handwritten proofreading marks in printed literary text, using a small benchmark based on Charles Dickens's "Little Dorrit". Results are modest at best, and surprisingly variable across repeated runs, even on the same pages, underscoring the challenge in building reliable, structured-document systems with current multimodal LLMs.

Curious to hear thoughts from others working on similar problems.

Re:Cosma Shalizi on Attention and Transformers on Sunday December 24, 2023 @07:54PM (#38758572)
No.

But to your point, note that in 2020 neuroscientists introduced the Tolman-Eichenbaum Machine (TEM) [1], a mathematical model of the hippocampus that bears a striking resemblance to transformer architecture.

Artem Kirsanov has a very nice piece on TEM, "Can we Build an Artificial Hippocampus?" [2] The link is directly to the spot where he makes the connection to transformers, although you should watch the whole video for context.

Because I wasn't clear on the chronology, I went back and asked one of the "Attention" authors whether mathematical models of the hippocampus inspired their paper? His answer was "no". If TEM was developed without pre-knowledge of transformers, then it's a very deep result IMHO.

[1] https://www.sciencedirect.com/science/article/pii/S009286742...

[2] https://www.youtube.com/watch?v=cufOEzoVMVA&t=1254s

Re:Cosma Shalizi on Attention and Transformers on Sunday December 24, 2023 @07:26PM (#38758413)
While in Google Research, I worked with two of the authors of the "Attention is All you Need" paper, including the gentleman who chose that title.

As others have pointed out, self-attention was already a known concept in the research community. They don't claim to have invented that. Rather, the authors began by looking at how to improve the power of feed-forward neural networks using a combination of techniques, obtained some exciting results, and then, in the course of ablation studies, discovered that attention was really all you needed!

The title is a play on the Beatles song, "All You Need Is Love".

In terms of expository style, the paper that was most helpful for me was [Formal Algorithms for Transformers](https://arxiv.org/abs/2207.09238) by Phuong and Hutter. Written for clarity and with an emphasis on precision, the motivation section (Section 2) of the paper does a great job of explaining deficiencies in the original paper and subsequent ones.

Re:What Is Retrieval-Augmented Generation a.k.a. RAG? on Friday December 01, 2023 @05:52PM (#38493678)
Take a look at the BEIR benchmark, which has served as one of the main drivers for development of neural IR systems since its introduction in 2020.

BM25 presents a challenging cross-domain benchmark, and it wasn't till ~2022 that neural methods overtook it. If memory serves, it was the sparse neural methods like Splade, although recent dense models can also beat it.

The caveat is that BEIR is suffering from overfitting at this point.

Re:What Is Retrieval-Augmented Generation a.k.a. RAG? on Friday December 01, 2023 @05:49PM (#38493647)
> but HNSW is the best 99% of the time for both performance and latency, and is implemented in almost every modern major vector store.

In my experience, HNSW indexes are very expensive to build, relative to indexes like IVF. They also have a larger memory footprint. IVF, on the other hand, is pretty trivial to parallelize across multiple machines, and while I'm aware there are techniques for doing that with HNSW, I don't know the details well enough.

Also, if you review papers like "SOAR: Improved Quantization for Approximate Nearest Neighbor Search", they hint at some of the throughput barriers faced by graph-based methods like HNSW.

Older »