<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: adgjlsfhk1</title><link>https://news.ycombinator.com/user?id=adgjlsfhk1</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sun, 12 Apr 2026 09:55:46 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=adgjlsfhk1" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by adgjlsfhk1 in "What is RISC-V and why it matters to Canonical"]]></title><description><![CDATA[
<p>you realize that every WD hdd and every nvidia gpu from the past couple years has a Risc-v in it?</p>
]]></description><pubDate>Sat, 11 Apr 2026 06:24:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=47727995</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47727995</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47727995</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "What is RISC-V and why it matters to Canonical"]]></title><description><![CDATA[
<p>> Do you think Apple spends more money than Intel on chip design?<p>Absolutely. Apple's R&D budget for 2025 was 34 Billion to Intel's ~18 Billion (and the majority of Intel's R&D budget goes to architecture, while for Apple, that is all TSMC R&D and Apple pays TSMC another ~$20 billion a year, of which, something like 8 billion is probably TSMC R&D that goes into apple's chips).<p>Sure not all of Apple's 34B is CPU R&D, but on a like-for-like basis, Apple probably has at least 50% more chip design budget (and they only make ~10-20 different chips a year compared to Intel who make ~100-200)</p>
]]></description><pubDate>Sat, 11 Apr 2026 06:23:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=47727987</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47727987</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47727987</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "What is RISC-V and why it matters to Canonical"]]></title><description><![CDATA[
<p>> good luck parsing through 100 different "performance optimization manuals" from 100 different companies.<p>Imo this is pretty misguided. If you're writing above assembly level, you can read the performance optimization manual for Intel, and that code will also be really fast on AMD (or even apple/graviton). At the assembly level, compilers need to know a little bit more, but mostly those are small details and if they get roughly the right metrics, the code they produce is pretty good.</p>
]]></description><pubDate>Sat, 11 Apr 2026 06:12:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=47727926</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47727926</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47727926</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>>  hybrid is proving to be quite difficult for entirely nontechnical reasons.<p>This is hard to square with the reality that hybrid systems are already widely deployed while pure PQC aren't/</p>
]]></description><pubDate>Wed, 08 Apr 2026 16:59:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=47692967</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47692967</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47692967</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>RSA was the first. If ECC didn't exit, no one would be saying that we have to hybridize Kyber, but since it does, and the hybrid has ~0% overhead, it's very silly not to.</p>
]]></description><pubDate>Wed, 08 Apr 2026 13:48:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=47690192</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47690192</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47690192</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>The requirement for favoring hybrid isn't that "you view classically breaking PQ algorithms as higher likelihood than QC breaking classical", but you think that the likelihood than QC breaking classical is less than a billion times more than the likelyhood of classically breaking PQ.<p>Hybrid has essentially no cost, so we should favor it as long as it has a greater than negligible chance of providing protection. IMO the likelihood of CRQCs breaking ECC is pretty high (>50% by 2040) and the odds of classically breaking lattices is low (<1% by 2050), but creating a 0.5% chance of breaking cryptography for the entire world seems way to high when we have a free mitigation right here.</p>
]]></description><pubDate>Wed, 08 Apr 2026 02:48:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=47684388</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47684388</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47684388</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>one more Pro hybrid only: reduction of transitions is doubtful since by the time PQC is clearly better, we're likely to have better PQC algorithms (and or better attacks that force more conservative parameters). At a bare minimum, we aren't ready to move to pure PQC until we can go a couple years without continued improvements in lattice reduction algorithms.</p>
]]></description><pubDate>Wed, 08 Apr 2026 02:24:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=47684163</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47684163</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47684163</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "Floating point from scratch: Hard Mode"]]></title><description><![CDATA[
<p>It's really annoying that IEEE set the exponent bias wrong. x!=0 => 1/x!=Inf was a totally achievable property if they had wanted it (by tweaking the implicit bias)</p>
]]></description><pubDate>Wed, 08 Apr 2026 02:11:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=47684048</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47684048</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47684048</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "Floating point from scratch: Hard Mode"]]></title><description><![CDATA[
<p>The one advantage of decimal floating point is that high schoolers have a better  understanding of where decimal rounding happens.</p>
]]></description><pubDate>Tue, 07 Apr 2026 21:19:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=47681500</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47681500</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47681500</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "Floating point from scratch: Hard Mode"]]></title><description><![CDATA[
<p>he would, but he very much designed the standard around the idea that if you wanted to implement a floating point algorithm you would hire him.</p>
]]></description><pubDate>Tue, 07 Apr 2026 15:40:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=47677041</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47677041</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47677041</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "Floating point from scratch: Hard Mode"]]></title><description><![CDATA[
<p>imo they were wrong almost as much as they were right. -0.0, the plethora of NaNs, and having separate Inf and NaN all make the life of people writing algorithms a lot more annoying for very little benefit.</p>
]]></description><pubDate>Tue, 07 Apr 2026 12:41:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=47674402</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47674402</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47674402</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>All of those are costs are at least as high for non-hybrid. The spec and API are just as easy to design (because we have really good and simple ECC libraries), and the bikeshedding and bickering will be a lot less if people stop trying to force pure PQC algorithms that lots of people see as incredibly risky for incredibly little benefit.</p>
]]></description><pubDate>Tue, 07 Apr 2026 04:28:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=47670762</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47670762</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47670762</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>They're a pretty bad stopgap: <a href="https://bas.westerbaan.name/notes/2026/04/02/factoring.html" rel="nofollow">https://bas.westerbaan.name/notes/2026/04/02/factoring.html</a>. Going to RSA-32000 only buys you ~a year once QCs can factor RSA-2048. In order to get a standard that would resist quantum attacks for realistic time, we would need MB to GB keys at least (see <a href="https://eprint.iacr.org/2017/351.pdf" rel="nofollow">https://eprint.iacr.org/2017/351.pdf</a> for a hilarious post-quantum RSA attempt that used terabyte size keys)</p>
]]></description><pubDate>Mon, 06 Apr 2026 20:44:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=47666808</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47666808</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47666808</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>The absolute low end of cost of a QC is the cost of an MRI machine ~100k-400k (cost of cooling the computer to super low temps). Sure we expect QCs to get faster and cheaper over time, but putting 100% faith in the security of the PQC algorithms seems like a bad idea with no upside.</p>
]]></description><pubDate>Mon, 06 Apr 2026 19:18:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=47665561</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47665561</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47665561</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>You can already factor a 6 digit number with a QC, but not with an algorithm that scales polynomially. The graph linked is for optimized variants of Shor's algorithm.</p>
]]></description><pubDate>Mon, 06 Apr 2026 19:10:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=47665434</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47665434</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47665434</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>IMO the idea that NSA only uses NOBUS backdoors is obviously false (see for example DES's 56 bit key size). The NSA is perfectly capable of publicly calling for an insecure algorithm and then having secret documentation to not use it for anything important.</p>
]]></description><pubDate>Mon, 06 Apr 2026 19:06:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=47665357</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47665357</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47665357</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "A cryptography engineer's perspective on quantum computing timelines"]]></title><description><![CDATA[
<p>I think the anti-hybrid argument the article makes is clearly wrong. Even if CRQCs existed today, we still should be using hybrid algorithms because even once CRQCs exist, they will be slow, expensive, and power hungry for at least a decade. The hybrid algorithms at a minimum make the cost of any attack ~$1M, which is way better than half of the PQC algorithms that made it to the 3rd stage of the PQC competition (2 of them can be broken on a laptop)</p>
]]></description><pubDate>Mon, 06 Apr 2026 18:46:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=47665123</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47665123</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47665123</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "Ubuntu now requires more RAM than Windows 11"]]></title><description><![CDATA[
<p>well to start, you likely have 2 screen size buffers for current and next frame. The primary code portion is drivers since the modern expectation is that you can plug in pretty much anything and have it work automatically.</p>
]]></description><pubDate>Sun, 05 Apr 2026 13:48:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=47649411</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47649411</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47649411</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "Electrical transformer manufacturing is throttling the electrified future"]]></title><description><![CDATA[
<p>the point is that the thing they would never be catching up on would be the surplus orders from the government.</p>
]]></description><pubDate>Sun, 05 Apr 2026 11:32:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=47648327</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47648327</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47648327</guid></item><item><title><![CDATA[New comment by adgjlsfhk1 in "OpenAI closes funding round at an $852B valuation"]]></title><description><![CDATA[
<p>even ignoring distillation, so long as hardware or ml get better over time, training a new model from scratch is cheaper the later you do it</p>
]]></description><pubDate>Wed, 01 Apr 2026 12:49:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=47600138</link><dc:creator>adgjlsfhk1</dc:creator><comments>https://news.ycombinator.com/item?id=47600138</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47600138</guid></item></channel></rss>