<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: Sesse__</title><link>https://news.ycombinator.com/user?id=Sesse__</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 15 Jun 2026 03:27:19 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=Sesse__" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by Sesse__ in "Twenty One Zero-Days in FFmpeg"]]></title><description><![CDATA[
<p>> ffmpeg and other media frameworks (Windows Media Foundation, Apple’s AVFramwork) only support static pipelines.<p>FFmpeg doesn't do “pipelines”. It's a library, not a framework.</p>
]]></description><pubDate>Sat, 13 Jun 2026 07:14:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=48514346</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=48514346</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48514346</guid></item><item><title><![CDATA[New comment by Sesse__ in "Lines of code got a better publicist"]]></title><description><![CDATA[
<p>It's a signal. It's not a strong signal, and you certainly should not base your entire perf on it, but if the number is unusually high or low, it's a signal that could warrant further investigation.<p>(I once worked with an engineer that had two PRs, both fairly small bug fixes, in a given calendar year, and when I looked more carefully, they did not have any other obvious output or impact.)</p>
]]></description><pubDate>Thu, 11 Jun 2026 17:48:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=48493803</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=48493803</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48493803</guid></item><item><title><![CDATA[New comment by Sesse__ in "OpenCV 5 Is Here: The Biggest Leap in Years for Computer Vision"]]></title><description><![CDATA[
<p>Also, performance is generally pretty low; I've been on projects where we rewrote OpenCV code into more-or-less obvious hand-rolled code and won 5x perf. The abstractions are generally a bit too thick and oriented around single pixels (which also makes the API a bit too verbose for my taste).</p>
]]></description><pubDate>Tue, 09 Jun 2026 16:12:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=48463020</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=48463020</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48463020</guid></item><item><title><![CDATA[New comment by Sesse__ in "Should you normalize RGB values by 255 or 256?"]]></title><description><![CDATA[
<p>Useful, then, that you can start several vectorized floating-point muls each cycle. (E.g., most modern x86 are 3/0.5 cycles for vmulps. No 20 cycles in sight.)</p>
]]></description><pubDate>Mon, 01 Jun 2026 20:35:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=48362298</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=48362298</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48362298</guid></item><item><title><![CDATA[New comment by Sesse__ in "Should you normalize RGB values by 255 or 256?"]]></title><description><![CDATA[
<p>You should multiply by 255.0, optionally add a dither (triangular is okay), and then let the FPU round using its default IEEE 754 round-to-nearest-ties-to-nearest-even mode. None of this crazy 0.5 stuff. :-)</p>
]]></description><pubDate>Mon, 01 Jun 2026 19:54:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=48361779</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=48361779</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48361779</guid></item><item><title><![CDATA[New comment by Sesse__ in "Frontier AI has broken the open CTF format"]]></title><description><![CDATA[
<p>Thank you, that is an interesting tidbit!</p>
]]></description><pubDate>Sun, 17 May 2026 13:44:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=48168865</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=48168865</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48168865</guid></item><item><title><![CDATA[New comment by Sesse__ in "Frontier AI has broken the open CTF format"]]></title><description><![CDATA[
<p>One of my teachers in elementary school told us that people in the Arabic world wore long garments because as Muslims, they believed the Messiah would be born by a male, and thus, it was important to have something to catch the baby as it unexpectedly popped out one day and would otherwise hit the ground.<p>She only really had two faults: She wasn't very bright, and she wasn't fond of children. I had her in about 80% of all my classes for six years. High school was a relief.</p>
]]></description><pubDate>Sat, 16 May 2026 14:07:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=48160392</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=48160392</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48160392</guid></item><item><title><![CDATA[New comment by Sesse__ in "Dav2d"]]></title><description><![CDATA[
<p>I can totally understand why people would want a memory-safe decoder, but a memory-safe encoder is niche. Finding a memory-safety bug in a decoder is a matter of finding a single unchecked integer field somewhere; finding a memory-safety bug in an encoder requires first finding some sort of logic bug in the encoder and then crafting an adversarial input that survives a number of highly lossy transformations.<p>Compare the number of CVEs against x264 (included decoders don't count!) and FFmpeg's H.264 decoder.</p>
]]></description><pubDate>Sun, 03 May 2026 10:47:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=47995608</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47995608</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47995608</guid></item><item><title><![CDATA[New comment by Sesse__ in "Dav2d"]]></title><description><![CDATA[
<p>> And as for Git web interfaces, the correct solution is to require logins to view complete history.<p>Why logins, exactly? Who would have such logins; developers only, or anyone who signs up? I'm not sure if this is an effective long-term mitigation, or simply a “wall of minimal height” like you point out that Anubis is.</p>
]]></description><pubDate>Sun, 03 May 2026 10:15:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=47995433</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47995433</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47995433</guid></item><item><title><![CDATA[New comment by Sesse__ in "Dav2d"]]></title><description><![CDATA[
<p>Also, relevant for forges: AI doesn't understand what it's clicking on. Git forges tend to e.g. have a lot of links like “download a tarball at this revision” which are super-expensive as far as resources go, and AI crawlers will click on those because they click on every link that looks shiny. (And there are a lot of revisions in a project like VLC!) Much, much more often than humans do.</p>
]]></description><pubDate>Sun, 03 May 2026 07:09:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=47994237</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47994237</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47994237</guid></item><item><title><![CDATA[New comment by Sesse__ in "Slava's Monoid Zoo"]]></title><description><![CDATA[
<p>Thanks, that's an interesting tidbit!<p>(The whole thing made me think about applications to SQL query optimizers, although I'm not sure if it's practically useful for anything.)</p>
]]></description><pubDate>Tue, 21 Apr 2026 16:45:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=47851274</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47851274</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47851274</guid></item><item><title><![CDATA[New comment by Sesse__ in "Slava's Monoid Zoo"]]></title><description><![CDATA[
<p>Is the word problem easier if the monoids are commutative? (Or even trivial? I haven't thought deeply about it.)</p>
]]></description><pubDate>Tue, 21 Apr 2026 16:22:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=47850973</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47850973</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47850973</guid></item><item><title><![CDATA[New comment by Sesse__ in "A cache-friendly IPv6 LPM with AVX-512 (linearized B+-tree, real BGP benchmarks)"]]></title><description><![CDATA[
<p>Sure, but how does this differ from a routing table with RPF (which is default in Linux already)?</p>
]]></description><pubDate>Mon, 20 Apr 2026 09:43:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=47832119</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47832119</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47832119</guid></item><item><title><![CDATA[New comment by Sesse__ in "A cache-friendly IPv6 LPM with AVX-512 (linearized B+-tree, real BGP benchmarks)"]]></title><description><![CDATA[
<p>I use Wireguard rarely enough that the AllowedIPs concept gets me every time. It gets easier when I replace it mentally with “Route=” :-)</p>
]]></description><pubDate>Mon, 20 Apr 2026 07:52:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=47831457</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47831457</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47831457</guid></item><item><title><![CDATA[New comment by Sesse__ in "A cache-friendly IPv6 LPM with AVX-512 (linearized B+-tree, real BGP benchmarks)"]]></title><description><![CDATA[
<p>The obvious question, I guess: How much faster are you than whatever is in the Linux kernel's FIB? (Although I assume they need RCU overhead and such. I have no idea what it all looks like internally.)</p>
]]></description><pubDate>Mon, 20 Apr 2026 06:31:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=47831028</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47831028</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47831028</guid></item><item><title><![CDATA[New comment by Sesse__ in "The world in which IPv6 was a good design (2017)"]]></title><description><![CDATA[
<p>> But there's now multipath TCP handover? Weird behaviour to want different network interfaces on different network share the same IP, and pass it along like a volleyball?<p>Mobile IP actually wanted to do this, it just never took off (not the least because both endpoints need to understand it to get route optimization). I think some Windows versions actually had partial Mobile IPv6 support.</p>
]]></description><pubDate>Sun, 19 Apr 2026 10:45:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=47823300</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47823300</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47823300</guid></item><item><title><![CDATA[New comment by Sesse__ in "SI Units for Request Rate (2024)"]]></title><description><![CDATA[
<p><a href="https://en.wikipedia.org/wiki/Angular_frequency" rel="nofollow">https://en.wikipedia.org/wiki/Angular_frequency</a><p>It's very convenient when you're working with periodic signals (say, when discussing the FFT); you don't have to drag a 2pi factor around everywhere.</p>
]]></description><pubDate>Sun, 19 Apr 2026 08:48:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=47822821</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47822821</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47822821</guid></item><item><title><![CDATA[New comment by Sesse__ in "SI Units for Request Rate (2024)"]]></title><description><![CDATA[
<p>That sounds too low; 3 m$Hz would probably be right, but 3 µ$Hz is very little.</p>
]]></description><pubDate>Sun, 19 Apr 2026 08:47:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=47822810</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47822810</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47822810</guid></item><item><title><![CDATA[New comment by Sesse__ in "SI Units for Request Rate (2024)"]]></title><description><![CDATA[
<p>Mostly, people who do “requests per day” have a lot lower load than 1100 requests/sec, too… it's a typical red flag for having a team that know a lot less about performance than they think.</p>
]]></description><pubDate>Sun, 19 Apr 2026 08:45:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=47822804</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47822804</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47822804</guid></item><item><title><![CDATA[New comment by Sesse__ in "IPv6 traffic crosses the 50% mark"]]></title><description><![CDATA[
<p>> Porting all of that to support ipv6 can easily be a multi-year project.<p>FWIW, as someone who has done exactly this in a megacorp (sloshing through homebrew technical debt with 32-bit assumptions baked in), the initial wave to get the most important systems working was measured in person-months. The long tail was a slog, of course, but it's not an all-or-nothing proposition.</p>
]]></description><pubDate>Thu, 16 Apr 2026 09:14:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=47790579</link><dc:creator>Sesse__</dc:creator><comments>https://news.ycombinator.com/item?id=47790579</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47790579</guid></item></channel></rss>