<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: difc</title><link>https://news.ycombinator.com/user?id=difc</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 08 Jul 2026 02:39:29 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=difc" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by difc in "Show HN: Salt – a systems language with Z3 theorem proving in the compiler"]]></title><description><![CDATA[
<p>Moving theorem proving upstream into compilers, sandboxes, and the browser seems like the future when we're dealing with increasingly sophisticated AIs. I'm working on similar formal methods but applied to agent sandboxing; do you see Z3 as a better fit than lean? <a href="https://github.com/coproduct-opensource/nucleus" rel="nofollow">https://github.com/coproduct-opensource/nucleus</a></p>
]]></description><pubDate>Thu, 02 Jul 2026 03:01:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=48755973</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=48755973</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48755973</guid></item><item><title><![CDATA[New comment by difc in "Ask HN: How do you solve AI's confused deputy problem?"]]></title><description><![CDATA[
<p>I'm building Nucleus for exactly this problem - using information flow control and formal methods, we can prevent confused deputies by proofs instead of heuristics.<p>Very much WIP, would appreciate any feedback. <a href="https://github.com/coproduct-opensource/nucleus" rel="nofollow">https://github.com/coproduct-opensource/nucleus</a></p>
]]></description><pubDate>Fri, 05 Jun 2026 01:29:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=48406907</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=48406907</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48406907</guid></item><item><title><![CDATA[New comment by difc in "Information Flow Kernel for Claude Code Hooks"]]></title><description><![CDATA[
<p>Everyone agrees that agent security is an area that needs significant improvement, and quickly. Using methods from information flow control, this is a lightweight demo of how web search can taint a Claude session so it doesn't allow writing after a accessing untrusted data.<p>This can be configured via profiles to more more or less restrictive.<p>Treat this as an example for now, more to come in the future.</p>
]]></description><pubDate>Tue, 31 Mar 2026 05:11:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=47582981</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=47582981</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47582981</guid></item><item><title><![CDATA[Information Flow Kernel for Claude Code Hooks]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/coproduct-opensource/nucleus/blob/main/docs/quickstart-hook.md">https://github.com/coproduct-opensource/nucleus/blob/main/docs/quickstart-hook.md</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47582980">https://news.ycombinator.com/item?id=47582980</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Tue, 31 Mar 2026 05:11:17 +0000</pubDate><link>https://github.com/coproduct-opensource/nucleus/blob/main/docs/quickstart-hook.md</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=47582980</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47582980</guid></item><item><title><![CDATA[New comment by difc in "Show HN: Nucleus – enforced permission envelopes for AI agents (Firecracker)"]]></title><description><![CDATA[
<p>Thanks! Currently network identity is host-based, but in the middle of introducing SPIFFE based on ZTunnel. Should be done in the next couple of days.<p>Runtime enforcement means that any side effects are routed through a proxy (nucleus-tool-proxy) that does realtime checks on permissions and gates the behavior.<p>SPIFFE for MicroVM agents is a compelling idea and I'll update when this is ready.</p>
]]></description><pubDate>Tue, 03 Feb 2026 03:32:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=46866118</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=46866118</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46866118</guid></item><item><title><![CDATA[Show HN: Nucleus – enforced permission envelopes for AI agents (Firecracker)]]></title><description><![CDATA[
<p>I’ve been building Nucleus because most “agent security” is still policy-only: a config file that says “don’t do bad things,” while the agent can still do them.<p>Nucleus is an OSS experiment that pairs a small, compositional permission model with runtime enforcement: *side effects are only reachable through an enforcing tool proxy*, inside a Firecracker microVM. The envelope is *non-escalating*: it can only tighten or terminate, never silently relax.<p>What works today:<p>* MCP tool proxy with *read / write / run* (enforced inside the microVM)
* default-deny egress + DNS allowlist + iptables drift detection (fail-closed) on Linux
* time + budget caps enforced
* hash-chained audit log + HMAC approval tokens (scoped, expiring) for gated ops<p>What’s missing (being upfront):<p>* web/search tools exist in the model but aren’t wired to MCP yet
* remote append-only audit storage + attestation are still roadmap
* early/rough; targeting “safe to run against sensitive codebases,” not “replace your local terminal”<p>Most of the code was written with Anthropic tools; I’ve been leaning on tests/fuzzing/proptests to keep it honest.<p>Would love feedback on: (1) dangerous capability combinations beyond the lethal trifecta, (2) what enforcement gaps you’d want closed first, (3) how you’d evaluate this vs gateway-only approaches.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46855770">https://news.ycombinator.com/item?id=46855770</a></p>
<p>Points: 3</p>
<p># Comments: 3</p>
]]></description><pubDate>Mon, 02 Feb 2026 13:25:50 +0000</pubDate><link>https://github.com/coproduct-opensource/nucleus</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=46855770</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46855770</guid></item><item><title><![CDATA[Semigroups, automata, and REST]]></title><description><![CDATA[
<p>Article URL: <a href="https://docs.google.com/document/d/1Sw9N52cAWsOsXHUrPBXgNSqOQBPOA403bQaQmijSrYg/edit?usp=sharing">https://docs.google.com/document/d/1Sw9N52cAWsOsXHUrPBXgNSqOQBPOA403bQaQmijSrYg/edit?usp=sharing</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12785523">https://news.ycombinator.com/item?id=12785523</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 25 Oct 2016 05:26:41 +0000</pubDate><link>https://docs.google.com/document/d/1Sw9N52cAWsOsXHUrPBXgNSqOQBPOA403bQaQmijSrYg/edit?usp=sharing</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=12785523</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12785523</guid></item><item><title><![CDATA[New comment by difc in "Discovering AST in JavaScript"]]></title><description><![CDATA[
<p>Nice post. Functional programming is an excellent paradigm for manipulating these data structures.<p>I wrote a limited visualizer for this a few years back.<p><a href="http://bl.ocks.org/bcrisp/6072748" rel="nofollow">http://bl.ocks.org/bcrisp/6072748</a></p>
]]></description><pubDate>Mon, 08 Jun 2015 22:39:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=9682976</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=9682976</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9682976</guid></item><item><title><![CDATA[New comment by difc in "Ask HN: 21-year-old coder recent grad has no idea what to do with his life"]]></title><description><![CDATA[
<p>Act I: The Setup<p>In this the protagonist discovers he is special, exceptional. He devotes time to thinking and researching career goals and world-changing ideas. Dreaming of reification and being lauded as the (Gauss|Galois|Mozart) of his generation, the present may be bleak, but the future is glorious.<p>Act II: The Crisis<p>In this, the protagonist discovers that he is challenged for his position. Others, caught up in the race of life, don't look deeply to see his talent, and communion with the muses is precious only as long as it relates to engineering goals. He is human, suffering financial and relational setbacks, feeling the muses have deserted him and he is fully mortal after all.<p>Act III: The Resolution<p>In this, the protagonist discovers he is not alone. Others around him, few to be sure, are equally talented and working to achieve their purpose. Perhaps he's at the 99.9th percentile and realizes there are still 6 million contemporaneous peers. Einstein, Crick, and Jobs all went through this before their breakthroughs. The protagonist finds a passion, gives it his heart and soul, and achieves Movement I of his life story.</p>
]]></description><pubDate>Tue, 09 Sep 2014 18:49:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=8291955</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=8291955</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=8291955</guid></item><item><title><![CDATA[New comment by difc in "Poetry, real danger, and ASP.NET"]]></title><description><![CDATA[
<p>Thanks for the excellent suggestions. My local transit agency doesn't have a reputation for complexity, but I'll do some research.<p>Yes, a startup would certainly offer the complexity I'm after. I'm not pursuing insurmountable complexity in its own right. I feel we should be doing programming at a vastly higher level of abstraction.<p>Maybe I ought to shift to Haskell development, or spin higher level of abstraction into a venture of its own. Thanks again.</p>
]]></description><pubDate>Wed, 30 Apr 2014 05:43:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=7671803</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=7671803</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=7671803</guid></item><item><title><![CDATA[Poetry, real danger, and ASP.NET]]></title><description><![CDATA[
<p>I'm a working ASP.NET Developer. I have the usual background in databases, Javascript, 3-tier architecture, AJAX, and so on. But what I want is an applied career working with graphs, networks, morphisms, and functors, where JSON falls away and transitive closure comes into play. I want to use Eigenvectors to tell what's important in data regardless of the data itself. I want to code with self-organizing semantic analysis tools (Microsoft Roslyn) and shortest-path algorithms. I want to model web services and complex systems using force-directed graphs (D3) that are rearranged on the fly to rewire the system. I want to compute system reliability not with Monkeys but with adjacency matrices.<p>I want bijective and injective, bipartite and clique, functors and connectedness and small world effects.<p>I don't want comfort. I want God, I want poetry, I want real danger, I want freedom, I want goodness, I want sin.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=7671485">https://news.ycombinator.com/item?id=7671485</a></p>
<p>Points: 2</p>
<p># Comments: 2</p>
]]></description><pubDate>Wed, 30 Apr 2014 03:43:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=7671485</link><dc:creator>difc</dc:creator><comments>https://news.ycombinator.com/item?id=7671485</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=7671485</guid></item></channel></rss>