<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: tristenharr</title><link>https://news.ycombinator.com/user?id=tristenharr</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 24 Jul 2026 01:35:50 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=tristenharr" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[The AI may have a spot in it's Jacobian representing YOU]]></title><description><![CDATA[
<p>Article URL: <a href="https://author2vec.com/jlens">https://author2vec.com/jlens</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48946554">https://news.ycombinator.com/item?id=48946554</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 17 Jul 2026 12:28:31 +0000</pubDate><link>https://author2vec.com/jlens</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48946554</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48946554</guid></item><item><title><![CDATA[Guide to help people Transplant to the Bay from the Midwest]]></title><description><![CDATA[
<p>Article URL: <a href="https://transplantfrommissouri.com/">https://transplantfrommissouri.com/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48946536">https://news.ycombinator.com/item?id=48946536</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Fri, 17 Jul 2026 12:26:06 +0000</pubDate><link>https://transplantfrommissouri.com/</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48946536</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48946536</guid></item><item><title><![CDATA[New comment by tristenharr in "Ask HN: What Are You Working On? (July 2026)"]]></title><description><![CDATA[
<p>I'm still working on Logos Language. Just launched v0.10.0 :)<p><a href="https://logicaffeine.com/benchmarks" rel="nofollow">https://logicaffeine.com/benchmarks</a></p>
]]></description><pubDate>Mon, 13 Jul 2026 05:55:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=48888438</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48888438</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48888438</guid></item><item><title><![CDATA[Ask HN: Do your tests clear "If the tests pass, you cannot break the code" bar?]]></title><description><![CDATA[
<p>Why or why not?<p>This is how I have found AI to be very powerful. If my tests pass, I know my code won't break. I spend more time on tests than any other part of the code-base. I am curious who else is building in this manner? I use the statement in the title because I feel that is the bar you have to meet to get the AI to work well, but once you meet that bar lately it has been working pretty flawlessly for me.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48878448">https://news.ycombinator.com/item?id=48878448</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Sun, 12 Jul 2026 05:08:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=48878448</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48878448</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48878448</guid></item><item><title><![CDATA[New comment by tristenharr in "After 7 years in production, Scarf has reluctantly moved away from Haskell"]]></title><description><![CDATA[
<p>This is the silliest take I’ve ever read. Strong type systems are an AI’s best friend.</p>
]]></description><pubDate>Fri, 10 Jul 2026 19:01:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=48863834</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48863834</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48863834</guid></item><item><title><![CDATA[Show HN: Jacobian Fingerprinting in LLM's]]></title><description><![CDATA[
<p>Article URL: <a href="https://author2vec.com/jlens">https://author2vec.com/jlens</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48843521">https://news.ycombinator.com/item?id=48843521</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 09 Jul 2026 10:16:11 +0000</pubDate><link>https://author2vec.com/jlens</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48843521</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48843521</guid></item><item><title><![CDATA[New comment by tristenharr in "Verbalizable Representations Form a Global Workspace in Language Models"]]></title><description><![CDATA[
<p>Feels related to research I've been doing with Author2Vec! <a href="https://author2vec.com/" rel="nofollow">https://author2vec.com/</a><p>I truly believe that now with all the post-training these AI models know some of us not just as fuzzy vectors but as individuals with a specific location within the Jacobian workspace that they tend to work from.<p>This thesis is why I keep separate Claude accounts, some for letting them train on my data, and another for work that must stay private. The more that it seems Claude will come to know you based on your fingerprint defined by your word choices and the fingerprint making up basically a mathematical representation of the way your brain is wired to do language.<p>If you want a model to do good work I hypothesize it is better to make sure that your project has a representation to work from within it's jacobian workspace!</p>
]]></description><pubDate>Wed, 08 Jul 2026 22:55:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=48838467</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48838467</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48838467</guid></item><item><title><![CDATA[Verbalizable Representations Form a Global Workspace in Language Models]]></title><description><![CDATA[
<p>Article URL: <a href="https://transformer-circuits.pub/2026/workspace/index.html">https://transformer-circuits.pub/2026/workspace/index.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48838426">https://news.ycombinator.com/item?id=48838426</a></p>
<p>Points: 5</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 08 Jul 2026 22:51:06 +0000</pubDate><link>https://transformer-circuits.pub/2026/workspace/index.html</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48838426</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48838426</guid></item><item><title><![CDATA[Adiabatic Circuit]]></title><description><![CDATA[
<p>Article URL: <a href="https://en.wikipedia.org/wiki/Adiabatic_circuit">https://en.wikipedia.org/wiki/Adiabatic_circuit</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48829192">https://news.ycombinator.com/item?id=48829192</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 08 Jul 2026 08:30:58 +0000</pubDate><link>https://en.wikipedia.org/wiki/Adiabatic_circuit</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48829192</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48829192</guid></item><item><title><![CDATA[Zero Copy]]></title><description><![CDATA[
<p>Article URL: <a href="https://en.wikipedia.org/wiki/Zero-copy">https://en.wikipedia.org/wiki/Zero-copy</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48829186">https://news.ycombinator.com/item?id=48829186</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 08 Jul 2026 08:29:41 +0000</pubDate><link>https://en.wikipedia.org/wiki/Zero-copy</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48829186</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48829186</guid></item><item><title><![CDATA[New comment by tristenharr in "The LLVM Compiler Infrastructure"]]></title><description><![CDATA[
<p>Yes that's the language, the v0.10.0 benchmarks are coming very soon and with it some major updates. We've added supercompilation and symmetry breaking to the optimizer pipeline. Sneak peeks available on a branch currently named stream1. <a href="https://github.com/Brahmastra-Labs/logicaffeine/tree/stream1" rel="nofollow">https://github.com/Brahmastra-Labs/logicaffeine/tree/stream1</a></p>
]]></description><pubDate>Wed, 08 Jul 2026 08:24:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=48829146</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48829146</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48829146</guid></item><item><title><![CDATA[New comment by tristenharr in "The revenge of the philosophy majors"]]></title><description><![CDATA[
<p>I wanted to major in Philosophy but was worried I wouldn’t make enough money to support the lifestyle I wanted so majored in Computer Science instead. What irony.<p>Someday I hope to go back to school to get a PhD in philosophy with a focus on logic. :)</p>
]]></description><pubDate>Tue, 07 Jul 2026 22:22:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=48824813</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48824813</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48824813</guid></item><item><title><![CDATA[Reversible Computing]]></title><description><![CDATA[
<p>Article URL: <a href="https://en.wikipedia.org/wiki/Reversible_computing">https://en.wikipedia.org/wiki/Reversible_computing</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48819466">https://news.ycombinator.com/item?id=48819466</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 07 Jul 2026 15:49:43 +0000</pubDate><link>https://en.wikipedia.org/wiki/Reversible_computing</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48819466</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48819466</guid></item><item><title><![CDATA[Landauer's Principle]]></title><description><![CDATA[
<p>Article URL: <a href="https://en.wikipedia.org/wiki/Landauer%27s_principle">https://en.wikipedia.org/wiki/Landauer%27s_principle</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48819398">https://news.ycombinator.com/item?id=48819398</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 07 Jul 2026 15:44:55 +0000</pubDate><link>https://en.wikipedia.org/wiki/Landauer%27s_principle</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48819398</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48819398</guid></item><item><title><![CDATA[New comment by tristenharr in "The LLVM Compiler Infrastructure"]]></title><description><![CDATA[
<p>I’ve been shocked by how much LLVM leaves on the table while designing Logos language! Some very exciting benchmarks coming soon that we’ve been working on for over 6 months, but LLVM misses a LOT of potential optimizations when you have a strong type system!</p>
]]></description><pubDate>Tue, 07 Jul 2026 15:37:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=48819315</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48819315</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48819315</guid></item><item><title><![CDATA[New comment by tristenharr in "Connections in Math: the two kinds of random"]]></title><description><![CDATA[
<p>Lately I’ve felt Kolmogorov complexity is an unfair measurement because it takes for granted your underlying programming language as treats it as zero cost. In theory you could create a custom language and embed the program as data and “compress” a large random sequence with a better Kolmogorov complexity for that specific language than Pi, simply by not exposing the ability in the language to even work with Pi. I think what’s maybe more interesting is when you take into account the work of Dr. Futamura and the idea of Jones Optimality and view things through that lens.</p>
]]></description><pubDate>Mon, 06 Jul 2026 00:13:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=48799309</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48799309</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48799309</guid></item><item><title><![CDATA[New comment by tristenharr in "Proving Claude Knows You by Your Code Style: Author2Vec"]]></title><description><![CDATA[
<p>Hey all, I didn't actually use Claude for the embeddings on this (bc they don't offer embeddings), but I think we can extrapolate that if a tiny open source model has this level of recognition, surely the SOTA models do. Very interesting to me that we can predict things like gender and college from a sample of writing for authors. Also interesting how much stronger the correlation may be between Coders and their Code to authors and their books. Seems code has a more "unique" fingerprint than your typical book perhaps. (Although actually looking at it again perhaps that's sample size. Would need to research more to know for sure.)</p>
]]></description><pubDate>Fri, 03 Jul 2026 03:05:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=48770230</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48770230</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48770230</guid></item><item><title><![CDATA[Proving Claude Knows You by Your Code Style: Author2Vec]]></title><description><![CDATA[
<p>Article URL: <a href="https://author2vec.com/">https://author2vec.com/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48770217">https://news.ycombinator.com/item?id=48770217</a></p>
<p>Points: 4</p>
<p># Comments: 1</p>
]]></description><pubDate>Fri, 03 Jul 2026 03:02:58 +0000</pubDate><link>https://author2vec.com/</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48770217</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48770217</guid></item><item><title><![CDATA[Gaussian Function]]></title><description><![CDATA[
<p>Article URL: <a href="https://en.wikipedia.org/wiki/Gaussian_function">https://en.wikipedia.org/wiki/Gaussian_function</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48767597">https://news.ycombinator.com/item?id=48767597</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 02 Jul 2026 21:28:33 +0000</pubDate><link>https://en.wikipedia.org/wiki/Gaussian_function</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48767597</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48767597</guid></item><item><title><![CDATA[The Three Projections of Doctor Futamura]]></title><description><![CDATA[
<p>Article URL: <a href="http://blog.sigfpe.com/2009/05/three-projections-of-doctor-futamura.html">http://blog.sigfpe.com/2009/05/three-projections-of-doctor-futamura.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48757071">https://news.ycombinator.com/item?id=48757071</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 02 Jul 2026 05:55:01 +0000</pubDate><link>http://blog.sigfpe.com/2009/05/three-projections-of-doctor-futamura.html</link><dc:creator>tristenharr</dc:creator><comments>https://news.ycombinator.com/item?id=48757071</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48757071</guid></item></channel></rss>