<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: joohwan</title><link>https://news.ycombinator.com/user?id=joohwan</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sun, 03 May 2026 17:35:09 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=joohwan" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by joohwan in "VS Code inserting 'Co-Authored-by Copilot' into commits regardless of usage"]]></title><description><![CDATA[
<p>> If you fell for this once again, there's nobody else to blame but yourself.<p>We don’t need snarky comments like this, especially when the technology in question is so pervasive and takes a lot of cognitive effort to avoid. The blame lies solely with Microsoft.</p>
]]></description><pubDate>Sun, 03 May 2026 00:36:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=47992020</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=47992020</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47992020</guid></item><item><title><![CDATA[New comment by joohwan in "Show HN: HoundDog.ai – Ultra-Fast Code Scanner for Data Privacy"]]></title><description><![CDATA[
<p>LLMs can find issues that traditional SAST misses, but today they are slow, expensive, and nondeterministic. SAST is fast and cheap, but requires heavy manual rule maintenance. Our approach combines the strengths of both. The scanning engine is fully rule based and deterministic, with a rule language expressive enough to model code at compiler level accuracy. AI is used only to generate broad rule coverage across thousands of patterns, without sacrificing scan performance or reliability.</p>
]]></description><pubDate>Mon, 02 Feb 2026 20:17:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=46860841</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=46860841</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46860841</guid></item><item><title><![CDATA[Show HN: HoundDog.ai – Ultra-Fast Code Scanner for Data Privacy]]></title><description><![CDATA[
<p>Hi HN,<p>I'm one of the creators of HoundDog.ai (<a href="https://github.com/hounddogai/hounddog" rel="nofollow">https://github.com/hounddogai/hounddog</a>). We currently handle privacy scanning for Replit's 45M+ creators.<p>We built HoundDog because privacy compliance is usually a choice between manual spreadsheets or reactive runtime scanning. While runtime tools are useful for monitoring, they only catch leaks after the code is live and the data has already moved. They can also miss code paths that aren't actively triggered in production.<p>HoundDog traces sensitive data in code during development and helps catch risky flows (e.g., PII leaking into logs or unapproved third-party SDKs) before the code is shipped.<p>The core scanner is a standalone Rust binary. It doesn't use LLMs so it's local, deterministic, cheap, and fast. It can scan 1M+ lines of code in seconds on a standard laptop, and supports 80+ sensitive data types (PII, PHI, CHD) and hundreds of data sinks (logs, SDKs, APIs, ORMs etc.) out of the box.<p>We use AI internally to expand and scale our rules, identifying new data sources and sinks, but the execution is pure static analysis.<p>The scanner is free to use (no signups) so please try it out and send us feedback. I'll be around to answer any questions!</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46857993">https://news.ycombinator.com/item?id=46857993</a></p>
<p>Points: 16</p>
<p># Comments: 6</p>
]]></description><pubDate>Mon, 02 Feb 2026 16:37:00 +0000</pubDate><link>https://github.com/hounddogai/hounddog</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=46857993</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46857993</guid></item><item><title><![CDATA[New comment by joohwan in "Is Clear Air Turbulence becoming more common?"]]></title><description><![CDATA[
<p>Why is this comment being downvoted? Is it not true?</p>
]]></description><pubDate>Fri, 28 Jun 2024 20:51:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=40825167</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=40825167</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40825167</guid></item><item><title><![CDATA[New comment by joohwan in "Show HN: Trophi.com – A forum the represents both sides of an argument"]]></title><description><![CDATA[
<p>I personally find the font very hard on the eyes.</p>
]]></description><pubDate>Mon, 25 Jan 2021 22:47:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=25910000</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=25910000</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=25910000</guid></item><item><title><![CDATA[New comment by joohwan in "Show HN: Colorpedia – command-line tool for looking up colors"]]></title><description><![CDATA[
<p>I've been working on a 2D game which involves pixel art. I wanted a way to quickly look up a color by hex code or RGB values on the terminal, but could not find a tool for it. So I created Colorpedia. It displays colors, shades and palettes along with details on multiple models (HSV, HSL, CMYK etc). It also outputs JSON for programmatic access.</p>
]]></description><pubDate>Mon, 25 Jan 2021 08:58:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=25901012</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=25901012</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=25901012</guid></item><item><title><![CDATA[Show HN: Colorpedia – command-line tool for looking up colors]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/colorpedia">https://github.com/joowani/colorpedia</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=25885214">https://news.ycombinator.com/item?id=25885214</a></p>
<p>Points: 11</p>
<p># Comments: 2</p>
]]></description><pubDate>Sat, 23 Jan 2021 19:17:52 +0000</pubDate><link>https://github.com/joowani/colorpedia</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=25885214</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=25885214</guid></item><item><title><![CDATA[Studying binary trees for assignment, exam or interview? Try binarytree (Python)]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/binarytree">https://github.com/joowani/binarytree</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=16279191">https://news.ycombinator.com/item?id=16279191</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 01 Feb 2018 01:56:47 +0000</pubDate><link>https://github.com/joowani/binarytree</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=16279191</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16279191</guid></item><item><title><![CDATA[Show HN: Directory Tags for Lazy Programmers]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/dtags">https://github.com/joowani/dtags</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=13144391">https://news.ycombinator.com/item?id=13144391</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 10 Dec 2016 06:31:46 +0000</pubDate><link>https://github.com/joowani/dtags</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=13144391</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13144391</guid></item><item><title><![CDATA[Show HN: Directory tags for lazy programmers]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/dtags">https://github.com/joowani/dtags</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12947171">https://news.ycombinator.com/item?id=12947171</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 14 Nov 2016 02:46:51 +0000</pubDate><link>https://github.com/joowani/dtags</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12947171</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12947171</guid></item><item><title><![CDATA[Show HN: Directory tags for lazy programmers]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/dtags">https://github.com/joowani/dtags</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12851231">https://news.ycombinator.com/item?id=12851231</a></p>
<p>Points: 6</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 01 Nov 2016 23:58:42 +0000</pubDate><link>https://github.com/joowani/dtags</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12851231</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12851231</guid></item><item><title><![CDATA[New comment by joohwan in "Show HN: KQ – Simple Job Queue for Python Using Kafka"]]></title><description><![CDATA[
<p>Fixed!</p>
]]></description><pubDate>Tue, 01 Nov 2016 03:47:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=12843231</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12843231</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12843231</guid></item><item><title><![CDATA[New comment by joohwan in "Show HN: KQ – Simple Job Queue for Python Using Kafka"]]></title><description><![CDATA[
<p>Very true. I indeed found the lack of visibility into per-message information very painful when I was building this. One way I tried to alleviate the issue was providing a consumer "callback" to make it easier for users to plug their own code in to handle job failures (like your example of using SQS).<p>I've also thought about reserving a topic + consumer group specifically for failed jobs and bake the retry logic into KQ itself. But that's an area I must explore more.<p>I'm not sure if I understand what you are saying about batching consumers. What do you mean by batching in this context? Thanks for your input.</p>
]]></description><pubDate>Tue, 01 Nov 2016 03:46:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=12843225</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12843225</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12843225</guid></item><item><title><![CDATA[Show HN: KQ – Simple Job Queue for Python Using Kafka]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/kq">https://github.com/joowani/kq</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12842797">https://news.ycombinator.com/item?id=12842797</a></p>
<p>Points: 116</p>
<p># Comments: 30</p>
]]></description><pubDate>Tue, 01 Nov 2016 01:58:47 +0000</pubDate><link>https://github.com/joowani/kq</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12842797</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12842797</guid></item><item><title><![CDATA[KQ: Kafka-Based Job Queue for Python]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/kq/tree/1.0">https://github.com/joowani/kq/tree/1.0</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12837158">https://news.ycombinator.com/item?id=12837158</a></p>
<p>Points: 6</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 31 Oct 2016 14:45:33 +0000</pubDate><link>https://github.com/joowani/kq/tree/1.0</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12837158</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12837158</guid></item><item><title><![CDATA[KQ: Kafka-Based Job Queue for Python]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/kq">https://github.com/joowani/kq</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12834302">https://news.ycombinator.com/item?id=12834302</a></p>
<p>Points: 7</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 31 Oct 2016 04:26:19 +0000</pubDate><link>https://github.com/joowani/kq</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12834302</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12834302</guid></item><item><title><![CDATA[Directory tags for lazy programmers]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/dtags">https://github.com/joowani/dtags</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12716513">https://news.ycombinator.com/item?id=12716513</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 16 Oct 2016 02:16:25 +0000</pubDate><link>https://github.com/joowani/dtags</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12716513</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12716513</guid></item><item><title><![CDATA[New comment by joohwan in "Python Library for Learning Binary Trees"]]></title><description><![CDATA[
<p>Thanks! I may create one for linkedlists in the future!</p>
]]></description><pubDate>Mon, 10 Oct 2016 02:00:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=12674579</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12674579</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12674579</guid></item><item><title><![CDATA[Python Library for Learning Binary Trees]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/binarytree">https://github.com/joowani/binarytree</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12672202">https://news.ycombinator.com/item?id=12672202</a></p>
<p>Points: 111</p>
<p># Comments: 6</p>
]]></description><pubDate>Sun, 09 Oct 2016 17:27:55 +0000</pubDate><link>https://github.com/joowani/binarytree</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12672202</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12672202</guid></item><item><title><![CDATA[Directory tags for lazy programmers]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/joowani/dtags">https://github.com/joowani/dtags</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=12627650">https://news.ycombinator.com/item?id=12627650</a></p>
<p>Points: 7</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 03 Oct 2016 14:29:47 +0000</pubDate><link>https://github.com/joowani/dtags</link><dc:creator>joohwan</dc:creator><comments>https://news.ycombinator.com/item?id=12627650</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12627650</guid></item></channel></rss>