<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: mutkach</title><link>https://news.ycombinator.com/user?id=mutkach</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 10 Apr 2026 05:07:20 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=mutkach" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by mutkach in "Show HN: I built a Cargo-like build tool for C/C++"]]></title><description><![CDATA[
<p>Please consider adding `cargo watch` - that would be a killer feature!</p>
]]></description><pubDate>Thu, 09 Apr 2026 17:28:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=47706571</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=47706571</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47706571</guid></item><item><title><![CDATA[New comment by mutkach in "Claude Code's source code has been leaked via a map file in their NPM registry"]]></title><description><![CDATA[
<p>/*<p>* Check if 1M context is disabled via environment variable.<p>* Used by C4E admins to disable 1M context for HIPAA compliance.<p>*/
export function is1mContextDisabled(): boolean {<p><pre><code>  return </code></pre>
isEnvTruthy(process.env.CLAUDE_CODE_DISABLE_1M_CONTEXT)<p>}<p>Interesting, how is that relevant to HIPAA compliance?</p>
]]></description><pubDate>Tue, 31 Mar 2026 13:29:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=47587083</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=47587083</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47587083</guid></item><item><title><![CDATA[New comment by mutkach in "I'm addicted to being useful"]]></title><description><![CDATA[
<p>Super-relatable.<p>Now that I think about it, most of my advice starts something like "Here's what you're gonna do..."<p>Wait, that itself sounds like a problem, but how do I fix it...</p>
]]></description><pubDate>Tue, 20 Jan 2026 13:55:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=46691868</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46691868</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46691868</guid></item><item><title><![CDATA[New comment by mutkach in "Programming language speed comparison using Leibniz formula for π"]]></title><description><![CDATA[
<p>You are correct, that was an uneducated guess on my part.<p>I just glanced at the IR which was different for some attributes (nounwind vs mustprogress norecurse), but the resulting assembly is 100% identical for every optimization level.</p>
]]></description><pubDate>Fri, 19 Dec 2025 21:22:38 +0000</pubDate><link>https://news.ycombinator.com/item?id=46331094</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46331094</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46331094</guid></item><item><title><![CDATA[New comment by mutkach in "Programming language speed comparison using Leibniz formula for π"]]></title><description><![CDATA[
<p>Probably LLVM runs different sets of optimization passes for C and C++. Need to look at the IR, or assembly to know exactly what happens.</p>
]]></description><pubDate>Fri, 19 Dec 2025 18:04:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=46328874</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46328874</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46328874</guid></item><item><title><![CDATA[New comment by mutkach in "From Zero to QED: An informal introduction to formality with Lean 4"]]></title><description><![CDATA[
<p>Sure, he is one of biggest advocates for it, and yet he was quite clear that it is not yet possible for him to do his actual research in Lean.<p>Quoting one of the recent papers (2020):<p>> With current technology, it would take many person-decades to formalise Scholze’s results. Indeed,
even stating Scholze’s theorems would be an achievement. Before that, one has of course to formalise
the definition of a perfectoid space, and this is what we have done, using the Lean theorem prover.</p>
]]></description><pubDate>Fri, 19 Dec 2025 13:37:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=46325707</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46325707</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46325707</guid></item><item><title><![CDATA[New comment by mutkach in "From Zero to QED: An informal introduction to formality with Lean 4"]]></title><description><![CDATA[
<p>I share your fascination with proof assistants and formal verification, but the reality is that I am yet to see an actual mathematician working on frontier research who is excited about formalizing their ideas, or enthusiastic about putting in the actual (additional) work to build the formalization prerequisites to even begin defining the theorem's statement in that (formal) language.</p>
]]></description><pubDate>Fri, 19 Dec 2025 13:25:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=46325580</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46325580</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46325580</guid></item><item><title><![CDATA[New comment by mutkach in "From Zero to QED: An informal introduction to formality with Lean 4"]]></title><description><![CDATA[
<p>Understanding IMO is "developing a correct mental model of a concept". 
Some heuristics of correctness:<p>Feynman: "What I cannot build. I do not understand"<p>Einstein: "If you can't explain it to a six year old, you don't understand it yourself"<p>Of course none of this changes anything around the machine generated proofs. The point of the proof is to communicate ideas; formalization and verification is simply a certificate showing that those ideas are worth checking out.</p>
]]></description><pubDate>Fri, 19 Dec 2025 12:37:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=46325155</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46325155</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46325155</guid></item><item><title><![CDATA[New comment by mutkach in "From Zero to QED: An informal introduction to formality with Lean 4"]]></title><description><![CDATA[
<p>> more than 1,000,000 lines of Lean 4 code and concluding with a QED.<p>Usually the point of the proof is not to figure out whether a particular statement is true (which may be of little interest by itself, see Collatz conjecture), but to develop some good ideas _while_ proving that statement. So there's not much value in verified 1mil lines of Lean by itself. 
You'd want to study the (Lean) proof hoping to find some kind of new math invented in it or a particular trick worth noticing.<p>LLM may first develop a proof in natural language, then prove its correctness while autoformalizing it in Lean. Maybe it will be worth something in that case.</p>
]]></description><pubDate>Fri, 19 Dec 2025 12:28:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=46325093</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46325093</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46325093</guid></item><item><title><![CDATA[New comment by mutkach in "History of Declarative Programming (2021)"]]></title><description><![CDATA[
<p>Before Church there was Peano, and before Peano there was Grassmann<p>> It is rather well-known, through Peano's own acknowledgement, that Peano […] made extensive use of Grassmann's work in his development of the axioms. It is not so well-known that Grassmann had essentially the characterization of the set of all integers, now customary in texts of modern algebra, that it forms an ordered integral domain in which each set of positive elements has a least member. […] [Grassmann's book] was probably the first serious and rather successful attempt to put numbers on a more or less axiomatic basis.</p>
]]></description><pubDate>Mon, 15 Dec 2025 07:19:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=46271354</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46271354</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46271354</guid></item><item><title><![CDATA[New comment by mutkach in "AI will make formal verification go mainstream"]]></title><description><![CDATA[
<p>What would you suggest as a reference problem (a benchmark of sorts) to try to play with formal methods for someone with just a bit of formal verification background but not in the field of software verification? Can you suggest some helpful materials?<p>I've come across TLA+ multiple times, but it seems it was more targeted towards distributed systems (Lamport being the creator, that makes sense). Is it correct, that it would be useless in other domains?</p>
]]></description><pubDate>Wed, 10 Dec 2025 13:42:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=46217613</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46217613</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46217613</guid></item><item><title><![CDATA[New comment by mutkach in "Revisiting "Let's Build a Compiler""]]></title><description><![CDATA[
<p>What do you mean exactly by "error-tolerance"? Is it like, each node is wrapped into a result type, that you have to match against each time you visit it, even though you know for a fact, that it is not empty or something like that?<p>I suppose that one of the pros of using tree-sitter is its portability? For example, I could define my grammar to both parse my code and to do proper syntax highlighting in the browser with the same library and same grammar? Is that correct? Also it is used in neovim extensively to define syntax for a languages? Otherwise it would have taken to slightly modify the grammar.</p>
]]></description><pubDate>Wed, 10 Dec 2025 13:32:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=46217506</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46217506</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46217506</guid></item><item><title><![CDATA[New comment by mutkach in "AI will make formal verification go mainstream"]]></title><description><![CDATA[
<p>I certainly hope so.<p>I wonder, what is the actual blocker right now? I'd assume that LLMs are still not very good with specifications and verifcation languages? Anyone tried Datalog, TLA+, etc. with LLMs? I suppose that Gemini was specifically trained on Lean. Or at least some IMO-finetuned fork of it. Anyhow, there's probably a large Lean dataset collected somewhere in Deepmind servers, but that's not certification applicable necessarily, I think?<p>> AI also creates a need to formally verify more software: rather than having humans review AI-generated code, I’d much rather have the AI prove to me that the code it has generated is correct.<p>At RL stage LLMs could game the training*, proving easier invariants then actually expected (the proof is correct and possibly short - means positive reward). It would take additional care it to set it up right.<p>* I mean, if you set it to generate a code AND a proof to it.</p>
]]></description><pubDate>Wed, 10 Dec 2025 12:41:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=46217051</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46217051</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46217051</guid></item><item><title><![CDATA[New comment by mutkach in "Revisiting "Let's Build a Compiler""]]></title><description><![CDATA[
<p>LLVM makes it so much easier to build a compiler - it's not even funny. Whenever I use it, I feel like I'm just arranging some rocks on a top of a pyramid.</p>
]]></description><pubDate>Wed, 10 Dec 2025 11:19:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=46216500</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46216500</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46216500</guid></item><item><title><![CDATA[New comment by mutkach in "Revisiting "Let's Build a Compiler""]]></title><description><![CDATA[
<p>What language do you use parser combinators in, and what kind of grammar do you parse usually? Nom was terribly verbose and unergonomic even by Rust's standards. Haskell's Megaparsec/Parsec is good but yeah, it's Haskell, you need to handle multiple monads (Parser itself is monadic, then your AST state, and maybe some error handling) at once and that's where I got confused. But I appreciated the elegance.<p>I experimented with PCs in Haskell and Rust (nom), then moved on to parser generators in Rust (pest.rs), Ocaml (Menhir), Haskell (Happy) and finally ended up with python's Lark - the speed of experimenting with different syntax/grammars is just insane.</p>
]]></description><pubDate>Wed, 10 Dec 2025 11:13:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=46216457</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46216457</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46216457</guid></item><item><title><![CDATA[New comment by mutkach in "Zellij: A terminal workspace with batteries included"]]></title><description><![CDATA[
<p>Does it support sending and executing commands to the panes like tmux does?<p>like this:<p>tmux send-keys -t 0:1.1 "ls" Enter<p>edit: well, yes, you can:<p>zellij action write-chars ls<p>zellij action write 10</p>
]]></description><pubDate>Fri, 05 Dec 2025 20:45:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=46167046</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46167046</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46167046</guid></item><item><title><![CDATA[New comment by mutkach in "Synadia and TigerBeetle Pledge $512k to the Zig Software Foundation"]]></title><description><![CDATA[
<p>That "itch" is exactly what I meant, lol! And I agree! 
I'd definitely give Rust a try. Playing around with types and traits until they click is genuinely addictive - it feels like solving a puzzle or something</p>
]]></description><pubDate>Fri, 05 Dec 2025 19:15:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=46165926</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46165926</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46165926</guid></item><item><title><![CDATA[New comment by mutkach in "Synadia and TigerBeetle Pledge $512k to the Zig Software Foundation"]]></title><description><![CDATA[
<p>More information is needed to give proper advice:<p>- Do you like filling out the type annotations in Python (making sure linter check passes)? Do you like TYPES in general?<p>- Do you like working with memory (crushing memory bugs, solving leaks)?<p>- Do you prefer imperative or functional approach more?</p>
]]></description><pubDate>Fri, 05 Dec 2025 18:40:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=46165392</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46165392</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46165392</guid></item><item><title><![CDATA[New comment by mutkach in "Functional Quadtrees"]]></title><description><![CDATA[
<p>I remember Arc randomly rewriting my bookmarks using some kind of summarization model or something like that, it also sometimes changed the name of downloaded files reinterpreting their names. Maybe it is related somehow.<p>Well, I guess it was the first AI-first browser, hence all this bs. I uninstalled it months ago...</p>
]]></description><pubDate>Thu, 04 Dec 2025 14:13:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=46147860</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46147860</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46147860</guid></item><item><title><![CDATA[New comment by mutkach in "The Rise of AI Denialism"]]></title><description><![CDATA[
<p>Another salesperson trying to jump on a departing bandwagon, without having an interesting product and not providing any valuable insights.<p>> grief<p>> denial<p>Yeah, and he's in the denial phase</p>
]]></description><pubDate>Tue, 02 Dec 2025 14:13:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=46121347</link><dc:creator>mutkach</dc:creator><comments>https://news.ycombinator.com/item?id=46121347</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46121347</guid></item></channel></rss>