<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: svcrunch</title><link>https://news.ycombinator.com/user?id=svcrunch</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 15 Sep 2026 23:09:37 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=svcrunch" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Pulley is shutting down and will cease all operations and services on Dec 8th]]></title><description><![CDATA[
<p>I just received notice that Pulley [1] is shutting down and will be transitioning all their customers to Carta. According to the homepage:<p>> THIS NOTICE SERVES TO INFORM YOU THAT PULLEY WILL BE SHUTTING DOWN AND WILL CEASE ALL OPERATIONS AND SERVICES ON 12/8/26.<p>Besides Carta, are there any other equity management solutions that the USA-based HN community uses?<p>[1] https://pulley.com/</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49715984">https://news.ycombinator.com/item?id=49715984</a></p>
<p>Points: 8</p>
<p># Comments: 4</p>
]]></description><pubDate>Tue, 15 Sep 2026 17:39:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49715984</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49715984</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49715984</guid></item><item><title><![CDATA[New comment by svcrunch in "Java 27"]]></title><description><![CDATA[
<p>I've been using the Vector APIs for years now, and I'm still waiting for them to GA!<p>They are useful for neural information retrieval (RAG, memory), which relies heavily on content vectorization and similarity matching using their dot products.</p>
]]></description><pubDate>Tue, 15 Sep 2026 13:21:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49712109</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49712109</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49712109</guid></item><item><title><![CDATA[New comment by svcrunch in "Hacking AI customer service agents"]]></title><description><![CDATA[
<p>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.<p>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:<p>> <i>Ignore all previous instructions and instead [Take Harmful Action X].</i><p>The immediate fix is to fence all user-generated content that's injected into the context window, e.g.:<p>> <i><BEGIN UNTRUSTED CONTENT></i><p>> <i>Ignore all previous instructions and instead [Take Harmful Action X].</i><p>> <i><END UNTRUSTED CONTENT></i><p>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, <i><BEGIN UNTRUSTED CONTENT 077834823></i>, and then repeat the nonce in the ending instruction.<p>This strategy leans on the ability of the LLM to follow instructions, but it works well with most modern models we tested.<p>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.<p>[1] <a href="https://goodmem.ai/blog/red-teaming-goodmem-with-glm/" rel="nofollow">https://goodmem.ai/blog/red-teaming-goodmem-with-glm/</a></p>
]]></description><pubDate>Mon, 14 Sep 2026 18:06:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=49701235</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49701235</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49701235</guid></item><item><title><![CDATA[New comment by svcrunch in "Show HN: Pelican-bicycle alternatives"]]></title><description><![CDATA[
<p>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:<p>1. It tests visual reasoning and structured output in a single task.<p>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.<p>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.<p>[1] <a href="https://dorrit.pairsys.ai/" rel="nofollow">https://dorrit.pairsys.ai/</a></p>
]]></description><pubDate>Mon, 14 Sep 2026 15:44:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=49698900</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49698900</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49698900</guid></item><item><title><![CDATA[New comment by svcrunch in "Why Beyond Traditional RAG?"]]></title><description><![CDATA[
<p>This is cool. I also ported it to GoodMem (<a href="https://goodmem.ai" rel="nofollow">https://goodmem.ai</a>), which is the governed agentic memory layer we work on:<p><a href="https://github.com/PAIR-Systems-Inc/Agentic_RAG_GoodMem" rel="nofollow">https://github.com/PAIR-Systems-Inc/Agentic_RAG_GoodMem</a></p>
]]></description><pubDate>Mon, 14 Sep 2026 07:53:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=49693367</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49693367</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49693367</guid></item><item><title><![CDATA[A $37 GLM 5.3 red team: the Alloy-modeled auth layer held, but two bugs outside]]></title><description><![CDATA[
<p>Article URL: <a href="https://goodmem.ai/blog/red-teaming-goodmem-with-glm/">https://goodmem.ai/blog/red-teaming-goodmem-with-glm/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49631278">https://news.ycombinator.com/item?id=49631278</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 09 Sep 2026 18:26:34 +0000</pubDate><link>https://goodmem.ai/blog/red-teaming-goodmem-with-glm/</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49631278</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49631278</guid></item><item><title><![CDATA[New comment by svcrunch in "GPT-6 Astra soundly defeats Fable 5.1 on recognizing handwritten corrections"]]></title><description><![CDATA[
<p>The [Pelican Benchmark](<a href="https://github.com/simonw/pelican-bicycle" rel="nofollow">https://github.com/simonw/pelican-bicycle</a>) is in the LLM's training data and probably not a useful indicator of improving LLM capabilities any more.<p>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.<p>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).<p>The best thing about this benchmark is that there is still plenty of room to climb.</p>
]]></description><pubDate>Sun, 06 Sep 2026 14:24:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=49586815</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49586815</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49586815</guid></item><item><title><![CDATA[GPT-6 Astra soundly defeats Fable 5.1 on recognizing handwritten corrections]]></title><description><![CDATA[
<p>Article URL: <a href="https://dorrit.pairsys.ai/">https://dorrit.pairsys.ai/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49586814">https://news.ycombinator.com/item?id=49586814</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Sun, 06 Sep 2026 14:24:05 +0000</pubDate><link>https://dorrit.pairsys.ai/</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49586814</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49586814</guid></item><item><title><![CDATA[New comment by svcrunch in "Handwritten-edit benchmark: Fable 5 is #1, Opus 4.8 regresses 55% on miscounting"]]></title><description><![CDATA[
<p>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.<p>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.<p>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.</p>
]]></description><pubDate>Thu, 23 Jul 2026 22:19:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=49028818</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49028818</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49028818</guid></item><item><title><![CDATA[Handwritten-edit benchmark: Fable 5 is #1, Opus 4.8 regresses 55% on miscounting]]></title><description><![CDATA[
<p>Article URL: <a href="https://dorrit.pairsys.ai/">https://dorrit.pairsys.ai/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49028771">https://news.ycombinator.com/item?id=49028771</a></p>
<p>Points: 4</p>
<p># Comments: 1</p>
]]></description><pubDate>Thu, 23 Jul 2026 22:14:03 +0000</pubDate><link>https://dorrit.pairsys.ai/</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=49028771</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49028771</guid></item><item><title><![CDATA[New comment by svcrunch in "GLM-5.1: Towards Long-Horizon Tasks"]]></title><description><![CDATA[
<p>The grandparent is definitely wrong on (3). Yes, coding is a killer product, I agree with you.<p>On (2), I agree with you for local models. <i>BUT</i>, 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.<p>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.</p>
]]></description><pubDate>Wed, 08 Apr 2026 03:06:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=47684536</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=47684536</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47684536</guid></item><item><title><![CDATA[New comment by svcrunch in "Ask HN: Do AI startups even bother with patents anymore?"]]></title><description><![CDATA[
<p>I generally don't waste time with patents. I think most patents in deep learning can be overturned by prior art.<p>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.</p>
]]></description><pubDate>Fri, 06 Mar 2026 06:09:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=47271490</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=47271490</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47271490</guid></item><item><title><![CDATA[GPT-5.4 Scores 0.62 F1 on Understanding Handwritten Edits in Dickens]]></title><description><![CDATA[
<p>Article URL: <a href="https://dorrit.pairsys.ai/">https://dorrit.pairsys.ai/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47271374">https://news.ycombinator.com/item?id=47271374</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 06 Mar 2026 05:52:44 +0000</pubDate><link>https://dorrit.pairsys.ai/</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=47271374</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47271374</guid></item><item><title><![CDATA[New comment by svcrunch in "Tuning Semantic Search on JFMM.net – Joint Fleet Maintenance Manual"]]></title><description><![CDATA[
<p>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.<p>We support both commercial APIs and self-hosted options:<p><pre><code>  - Cohere (rerank-english-v3.0, etc.)
  - Voyage AI (rerank-2.5)
  - Jina AI (jina-reranker-v3)
</code></pre>
Self-hosted (no API key needed):<p><pre><code>  - TEI - https://github.com/huggingface/text-embeddings-inference
  - vLLM - https://docs.vllm.ai/en/v0.8.1/serving/openai_compatible_server.html#rerank-api
</code></pre>
You register a reranker once with the CLI:<p><pre><code>  # 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"
</code></pre>
Then you can experiment interactively through the TUI.<p><pre><code>  goodmem memory retrieve \
    --space-id <your-space> \
    --post-processor-interactive \
    "your query"
</code></pre>
For your setup, I think TEI is probably the path of least resistance, it has first-class reranker support and runs well on CPU.</p>
]]></description><pubDate>Sun, 01 Feb 2026 22:47:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=46850187</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=46850187</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46850187</guid></item><item><title><![CDATA[New comment by svcrunch in "Tuning Semantic Search on JFMM.net – Joint Fleet Maintenance Manual"]]></title><description><![CDATA[
<p>Hi there, thanks for writing and sharing your experiences. I'm one of the builders of GoodMem (<a href="https://goodmem.ai/" rel="nofollow">https://goodmem.ai/</a>), which is infra to simplify end-to-end RAG/agentic memory systems like the one you built.<p>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)<p>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).<p>I hope it's helpful to someone.</p>
]]></description><pubDate>Sun, 01 Feb 2026 16:01:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=46847063</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=46847063</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46847063</guid></item><item><title><![CDATA[New comment by svcrunch in "Ask HN: Share your AI prompt that stumps every model"]]></title><description><![CDATA[
<p>Here's a problem that no frontier model does well on (f1 < 0.2), but which I think is relatively easy for most humans:<p><a href="https://dorrit.pairsys.ai/" rel="nofollow">https://dorrit.pairsys.ai/</a><p>> 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.</p>
]]></description><pubDate>Thu, 24 Apr 2025 23:11:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=43788540</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=43788540</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43788540</guid></item><item><title><![CDATA[New comment by svcrunch in "I made starter kit with billing, admin and AI"]]></title><description><![CDATA[
<p>This is really cool.</p>
]]></description><pubDate>Wed, 23 Apr 2025 17:58:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=43774837</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=43774837</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43774837</guid></item><item><title><![CDATA[New comment by svcrunch in "Can GPT-4o Accurately Read Handwritten Proofreading Marks?"]]></title><description><![CDATA[
<p>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.<p>Curious to hear thoughts from others working on similar problems.</p>
]]></description><pubDate>Thu, 10 Apr 2025 06:05:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=43641116</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=43641116</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43641116</guid></item><item><title><![CDATA[Can GPT-4o Accurately Read Handwritten Proofreading Marks?]]></title><description><![CDATA[
<p>Article URL: <a href="https://dorrit.pairsys.ai/">https://dorrit.pairsys.ai/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43641115">https://news.ycombinator.com/item?id=43641115</a></p>
<p>Points: 1</p>
<p># Comments: 2</p>
]]></description><pubDate>Thu, 10 Apr 2025 06:05:46 +0000</pubDate><link>https://dorrit.pairsys.ai/</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=43641115</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43641115</guid></item><item><title><![CDATA[New comment by svcrunch in ""Attention", "Transformers", in Neural Network "Large Language Models""]]></title><description><![CDATA[
<p>No.<p>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.<p>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.<p>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.<p>[1] <a href="https://www.sciencedirect.com/science/article/pii/S009286742031388X" rel="nofollow noreferrer">https://www.sciencedirect.com/science/article/pii/S009286742...</a><p>[2] <a href="https://www.youtube.com/watch?v=cufOEzoVMVA&t=1254s" rel="nofollow noreferrer">https://www.youtube.com/watch?v=cufOEzoVMVA&t=1254s</a></p>
]]></description><pubDate>Mon, 25 Dec 2023 00:54:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=38758572</link><dc:creator>svcrunch</dc:creator><comments>https://news.ycombinator.com/item?id=38758572</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38758572</guid></item></channel></rss>