<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: kianN</title><link>https://news.ycombinator.com/user?id=kianN</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 09 Sep 2026 23:54:44 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=kianN" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Logs as Tables]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.sturdystatistics.com/posts/logs_as_tables/">https://blog.sturdystatistics.com/posts/logs_as_tables/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49424532">https://news.ycombinator.com/item?id=49424532</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 24 Aug 2026 19:13:22 +0000</pubDate><link>https://blog.sturdystatistics.com/posts/logs_as_tables/</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=49424532</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49424532</guid></item><item><title><![CDATA[New comment by kianN in "DuckDB – Data power tools for your laptop, now in Clojure (2023)"]]></title><description><![CDATA[
<p>It really is - we use duckdb as our main workhorse in our entire stack.<p>As a side note, thank you for all the work you have done in the Clojure ecosystem! Techascent’s data science packages was a major tipping point in my company’s decision to build our data science ecosystem in Clojure and has been wonderful to work with.</p>
]]></description><pubDate>Wed, 05 Aug 2026 07:59:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=49179865</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=49179865</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49179865</guid></item><item><title><![CDATA[New comment by kianN in "DuckDB – Data power tools for your laptop, now in Clojure (2023)"]]></title><description><![CDATA[
<p>I’m a big fan of tmducken. We use it heavily in our prod systems. That said, we’ve recently started exploring ducktape [1] in our new projects and have been really impressed with the performance. It also support more complex types on insertions and queries which has been helpful for us. Not affiliated with the project, but just wanted to show it some love since it’s a bit newer. It was created by an active contributor to tmducken.<p>[1] <a href="https://github.com/dynamic-alpha/ducktape" rel="nofollow">https://github.com/dynamic-alpha/ducktape</a></p>
]]></description><pubDate>Wed, 05 Aug 2026 00:11:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=49176989</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=49176989</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49176989</guid></item><item><title><![CDATA[New comment by kianN in "Launch HN: Agnost AI (YC S26) – Extract user feedback from agent conversations"]]></title><description><![CDATA[
<p>Happy to chat more in depth if more details would be helpful. I think my contact info is accessible from my HN profile.</p>
]]></description><pubDate>Wed, 15 Jul 2026 04:52:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=48916412</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=48916412</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48916412</guid></item><item><title><![CDATA[New comment by kianN in "Launch HN: Agnost AI (YC S26) – Extract user feedback from agent conversations"]]></title><description><![CDATA[
<p>To clarify, I wasn't criticizing your approach or product, more responding to the people dismissing the problem you are solving.<p>Regarding my experience, I have done a fair amount of work in the contact center space with long calls. I used statistical Bayesian approaches which I found to be much more resilient especially on long documents than embeddings/transformers. It also provided a joint modeling foundation for classification with much lower label requirements than BERT or traditional ML.</p>
]]></description><pubDate>Wed, 15 Jul 2026 02:16:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=48915469</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=48915469</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48915469</guid></item><item><title><![CDATA[New comment by kianN in "Launch HN: Agnost AI (YC S26) – Extract user feedback from agent conversations"]]></title><description><![CDATA[
<p>I see a fair number of comments here advocating for either codex to hand-roll this themselves, or to simply punt to SQL. I do want to advocate for the difficulty of the problem, even if I can't speak to the company itself.<p>At the scale of a few hundred to a few thousand documents, especially short documents, there are a few out of the box methods that can yield reasonable results, whether it be embedding clustering or leveraging LLMs for tagging.<p>However as your (1) datasets gets larger (2) documents expand from tweets and text messages to 30+ minute conversations and (3) you build downstream analytics on top of the learned semantic units, you really start to feel the limitations of LLMs and embedding for reliable annotation. That doesn't even get into the nuances associated with taxonomy management, seasonality, and model drift.<p>TLDR; this problem solved effectively has a lot of value and is a lot harder than it seems.</p>
]]></description><pubDate>Tue, 14 Jul 2026 23:54:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=48914496</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=48914496</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48914496</guid></item><item><title><![CDATA[Why We Don't Trust the Database with Authentication]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.sturdystatistics.com/posts/api_keys/">https://blog.sturdystatistics.com/posts/api_keys/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48814503">https://news.ycombinator.com/item?id=48814503</a></p>
<p>Points: 37</p>
<p># Comments: 23</p>
]]></description><pubDate>Tue, 07 Jul 2026 06:59:27 +0000</pubDate><link>https://blog.sturdystatistics.com/posts/api_keys/</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=48814503</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48814503</guid></item><item><title><![CDATA[Two Kinds of Programs: Closed Worlds and Open Worlds]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.sturdystatistics.com/posts/open_world/">https://blog.sturdystatistics.com/posts/open_world/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48349345">https://news.ycombinator.com/item?id=48349345</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 31 May 2026 20:19:26 +0000</pubDate><link>https://blog.sturdystatistics.com/posts/open_world/</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=48349345</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48349345</guid></item><item><title><![CDATA[New comment by kianN in "Three constraints before I build anything"]]></title><description><![CDATA[
<p>The author really extracted the core tenants of exactly how my former research mentor and I ended up building our business.<p>We started with the second two points: our core technology was a sampler that enables arbitrary hierarchical Bayesian graph models for sparse data, our constraint was cpu bound tractable compute. The piece that took us the longest to discover was the fact that our end products need to be separate from our underlying technology.<p>We were given that advice in various words from many people even before we started but some lessons need to be lived to be learned.</p>
]]></description><pubDate>Mon, 27 Apr 2026 03:52:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=47917546</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47917546</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47917546</guid></item><item><title><![CDATA[Why Congress may spend $1B on Great Salt Lake]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.npr.org/2026/04/24/nx-s1-5746844/why-trump-wants-to-spend-1-billion-on-great-salt-lake">https://www.npr.org/2026/04/24/nx-s1-5746844/why-trump-wants-to-spend-1-billion-on-great-salt-lake</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47897512">https://news.ycombinator.com/item?id=47897512</a></p>
<p>Points: 4</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 25 Apr 2026 00:40:14 +0000</pubDate><link>https://www.npr.org/2026/04/24/nx-s1-5746844/why-trump-wants-to-spend-1-billion-on-great-salt-lake</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47897512</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47897512</guid></item><item><title><![CDATA[Why scientists are nervous about fungi]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.npr.org/2026/04/17/g-s1-117632/fungi-drug-resistant-yeast-infection">https://www.npr.org/2026/04/17/g-s1-117632/fungi-drug-resistant-yeast-infection</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47807285">https://news.ycombinator.com/item?id=47807285</a></p>
<p>Points: 6</p>
<p># Comments: 1</p>
]]></description><pubDate>Fri, 17 Apr 2026 15:53:36 +0000</pubDate><link>https://www.npr.org/2026/04/17/g-s1-117632/fungi-drug-resistant-yeast-infection</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47807285</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47807285</guid></item><item><title><![CDATA[New comment by kianN in "The 185-Microsecond Type Hint"]]></title><description><![CDATA[
<p>Roughtime is a really cool protocol we came across when we were hardening a license server. It provides a distributed mechanism for cryptographically verifiable time via chained requests. It’s not as precise as NTP (hence rough) but in practice it’s more than precise enough. It also has some nice additional properties: for example, NTP servers are often used as DDOS amplifiers, whereas roughtime servers return a smaller payload than the request.<p>The ecosystem is currently very young. Each additional deployment meaningfully strengthens the ecosystem (ours is only the fifth server) and each additional implementation 
helps harden the spec (which is soon approaching 1.0).<p>We wrote a bit more about it in a separate article: <a href="https://blog.sturdystatistics.com/posts/roughtime/" rel="nofollow">https://blog.sturdystatistics.com/posts/roughtime/</a><p>Official protocol document: <a href="https://datatracker.ietf.org/doc/html/draft-ietf-ntp-roughtime-15#name-necessary-configuration" rel="nofollow">https://datatracker.ietf.org/doc/html/draft-ietf-ntp-roughti...</a></p>
]]></description><pubDate>Tue, 03 Mar 2026 16:09:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=47234539</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47234539</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47234539</guid></item><item><title><![CDATA[The 185-Microsecond Type Hint]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.sturdystatistics.com/posts/type_hint/">https://blog.sturdystatistics.com/posts/type_hint/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47224832">https://news.ycombinator.com/item?id=47224832</a></p>
<p>Points: 75</p>
<p># Comments: 14</p>
]]></description><pubDate>Mon, 02 Mar 2026 22:04:56 +0000</pubDate><link>https://blog.sturdystatistics.com/posts/type_hint/</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47224832</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47224832</guid></item><item><title><![CDATA[New comment by kianN in "State of Show HN: 2025"]]></title><description><![CDATA[
<p>Haha that’s true, but the timezone is left as an exercise for the reader for now</p>
]]></description><pubDate>Tue, 17 Feb 2026 02:20:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=47042946</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47042946</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47042946</guid></item><item><title><![CDATA[New comment by kianN in "State of Show HN: 2025"]]></title><description><![CDATA[
<p>We are going to publish that publicly next time we have a free day, though its publication will likely render the analysis redundant :)</p>
]]></description><pubDate>Tue, 17 Feb 2026 01:42:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=47042664</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47042664</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47042664</guid></item><item><title><![CDATA[New comment by kianN in "State of Show HN: 2025"]]></title><description><![CDATA[
<p>Yeah Show HN has a pretty interesting distribution compared to standard posts due to the long-term visibility on the Show page. The odds of a Show HN post breaking 10 points is significantly higher than an average post, but of the posts that clear 10 points, I recall the likelihood of breaking 100 points to be similar to a regular post.<p>As a sidenote: That clock is so cool: I was just mesmerized for multiple minutes!</p>
]]></description><pubDate>Tue, 17 Feb 2026 00:10:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=47042034</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47042034</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47042034</guid></item><item><title><![CDATA[New comment by kianN in "State of Show HN: 2025"]]></title><description><![CDATA[
<p>The code provided is to reproduce the analytical results from the annotated data; my impression is that you're more interested in the details of the annotation process than running into an issue with that code?<p>My company's core technology extends topic models to enable arbitrary hierarchical graphs, with additional branches beyond the topic and word branch.  We expose those annotations in a SQL interface. It's an alternative/complementary approach to embeddings/LLMs for working with text data. In this case, the hierarchy broke submissions down into paragraphs added a layer to pool them into submissions, and added one more layer to pool them by year (on the topic branch).<p>Our word branch is a bit more complicated, but we have some extended documentation on our website if you are interested in digging a bit deeper. Always happy to chat more about the technical details of our topic models if you have any questions!<p>Overview of Our Technology: <a href="https://blog.sturdystatistics.com/posts/technology/" rel="nofollow">https://blog.sturdystatistics.com/posts/technology/</a><p>Technical Docs: <a href="https://docs.sturdystatistics.com" rel="nofollow">https://docs.sturdystatistics.com</a></p>
]]></description><pubDate>Mon, 16 Feb 2026 23:58:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=47041963</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47041963</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47041963</guid></item><item><title><![CDATA[New comment by kianN in "State of Show HN: 2025"]]></title><description><![CDATA[
<p>I totally agree that the metric is imperfect for a long term analysis. I was initially leaning toward a quantile based approach to really focus in on topic trends over time, but when I was initially exploring the data, the relative challenge of having a Show HN become popular in 2025 compared to previous years caught my curiosity, and for this decade I felt a static cutoff provided a simple and easy to understand threshold.<p>I do think as a metric for total reach, a static cutoff actually works reasonably well.  I think some form of square root normalization over total users is probably the best balance.</p>
]]></description><pubDate>Mon, 16 Feb 2026 22:17:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=47041109</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47041109</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47041109</guid></item><item><title><![CDATA[New comment by kianN in "State of Show HN: 2025"]]></title><description><![CDATA[
<p>Thank you! I currently don’t have much insight to this current trend. At the time of this analysis I hadn’t even heard of Clawd but that would definitely be worth my revisiting.<p>I was planning on doing this yearly but the Clawd excitement is definitely worth diving into.</p>
]]></description><pubDate>Mon, 16 Feb 2026 20:31:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=47039928</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47039928</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47039928</guid></item><item><title><![CDATA[State of Show HN: 2025]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.sturdystatistics.com/posts/show_hn/">https://blog.sturdystatistics.com/posts/show_hn/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47039478">https://news.ycombinator.com/item?id=47039478</a></p>
<p>Points: 134</p>
<p># Comments: 34</p>
]]></description><pubDate>Mon, 16 Feb 2026 19:55:23 +0000</pubDate><link>https://blog.sturdystatistics.com/posts/show_hn/</link><dc:creator>kianN</dc:creator><comments>https://news.ycombinator.com/item?id=47039478</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47039478</guid></item></channel></rss>