<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: raluk</title><link>https://news.ycombinator.com/user?id=raluk</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 06 Apr 2026 04:40:21 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=raluk" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by raluk in "Ask HN: What are you proud of about doing for you health and wellness regularly?"]]></title><description><![CDATA[
<p>It improves immune system and geneal wellbeing. It is pain that you can get used to and I kind of enyoj it now in some weird way. It is hard, requires some dedication and brings some benefits, but does not requre extra time or planning. Great morale booster.</p>
]]></description><pubDate>Tue, 13 Jan 2026 00:27:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=46595931</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=46595931</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46595931</guid></item><item><title><![CDATA[New comment by raluk in "Ask HN: What are you working on? (January 2026)"]]></title><description><![CDATA[
<p>Over the hollidays I was working on Steve Balmers interview puzzle.
<a href="https://rahne.si/optimisation/2026/01/07/steve-ballmer-interview.html" rel="nofollow">https://rahne.si/optimisation/2026/01/07/steve-ballmer-inter...</a><p>What I am most proud of is that I got the solution in the corse of apporx 1 week working on this!</p>
]]></description><pubDate>Mon, 12 Jan 2026 15:51:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=46590064</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=46590064</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46590064</guid></item><item><title><![CDATA[New comment by raluk in "Ask HN: What are you proud of about doing for you health and wellness regularly?"]]></title><description><![CDATA[
<p>Using only cold water for showers.</p>
]]></description><pubDate>Mon, 12 Jan 2026 15:02:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=46589451</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=46589451</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46589451</guid></item><item><title><![CDATA[New comment by raluk in "Rust--: Rust without the borrow checker"]]></title><description><![CDATA[
<p>What are protental issues with compiler, by just disabling borrow checker? If I recall correctly some compiler optimisations for rust can not be done in C/C++ because of restrictions implied by borrow checker.</p>
]]></description><pubDate>Thu, 01 Jan 2026 11:37:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=46453306</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=46453306</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46453306</guid></item><item><title><![CDATA[New comment by raluk in "Hacker News front page now, but the titles are honest"]]></title><description><![CDATA[
<p>"Math nerd explains how to spend 3 days proving 1+1=2"  -> Original 
"From Zero to QED: An informal introduction to formality with Lean 4" 
<a href="https://news.ycombinator.com/item?id=46259343">https://news.ycombinator.com/item?id=46259343</a></p>
]]></description><pubDate>Fri, 19 Dec 2025 18:28:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=46329145</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=46329145</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46329145</guid></item><item><title><![CDATA[New comment by raluk in "You can't fool the optimizer"]]></title><description><![CDATA[
<p>Years ago I wrote c++ library for stream compostion. Something like C++20 ranges.
It turns out that as long as you compose everything with lambdas, compiled code is same as it would be with naive loops. Everything gets optimised.<p>For example, you can write sum of numbers less than n as:<p><pre><code>  count(uint64_t(0)) 
   | take(n) 
   | sum<uint64_t>();
</code></pre>
Clang converted this into n*(n-1)/2.</p>
]]></description><pubDate>Thu, 04 Dec 2025 20:08:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=46152292</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=46152292</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46152292</guid></item><item><title><![CDATA[Soniox released STT model v3 - A new standard for understanding speech]]></title><description><![CDATA[
<p>Article URL: <a href="https://soniox.com/blog/2025-10-21-soniox-v3">https://soniox.com/blog/2025-10-21-soniox-v3</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45655859">https://news.ycombinator.com/item?id=45655859</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Tue, 21 Oct 2025 13:55:08 +0000</pubDate><link>https://soniox.com/blog/2025-10-21-soniox-v3</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=45655859</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45655859</guid></item><item><title><![CDATA[New comment by raluk in "Discrete Fourier Transform"]]></title><description><![CDATA[
<p>How much is fft used for AI? Seems that attention and convolution could benefit from this.</p>
]]></description><pubDate>Sat, 04 Oct 2025 10:29:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=45472297</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=45472297</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45472297</guid></item><item><title><![CDATA[New comment by raluk in "Go is still not good"]]></title><description><![CDATA[
<p>Having lexicial scope it is same as -> defer fn{if(some condition) x() }() within scope.</p>
]]></description><pubDate>Sat, 23 Aug 2025 08:46:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=44994436</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44994436</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44994436</guid></item><item><title><![CDATA[New comment by raluk in "Scientists just found a protein that reverses brain aging in mice"]]></title><description><![CDATA[
<p>Given that you die, when one vital organ dies it will eventaully hapen in this way or another. I read somwhere and that stuck in my brain, that maxmimal logevity for humans is estimated to be approximetly 125 years.</p>
]]></description><pubDate>Fri, 22 Aug 2025 20:43:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=44989575</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44989575</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44989575</guid></item><item><title><![CDATA[New comment by raluk in "Asynchrony is not concurrency"]]></title><description><![CDATA[
<p>This is what i hand in mind whit "manually handing of futures". 
In this case you have to write<p><pre><code>   Promise1 = f1(); Promise2 = f2();
   v1,v2 = await Join(Promise1, Promise2);
   return v1 + v2
</code></pre>
I think this is just too much of synthactic noise.<p>On the other hand, it is necessary becase some of underlying async calls can be order dependend.<p>for example<p><pre><code>    await sock.rec(1) == 'A' && await sock.rec(1) == 'B'
</code></pre>
checks that first received socket byte is A and second is B. This is clearly order dependant that can't be executed concurrently out of order.</p>
]]></description><pubDate>Sat, 19 Jul 2025 05:32:38 +0000</pubDate><link>https://news.ycombinator.com/item?id=44612839</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44612839</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44612839</guid></item><item><title><![CDATA[New comment by raluk in "Asynchrony is not concurrency"]]></title><description><![CDATA[
<p>In there is also ApplicativeDo that works nicely with this.<p><pre><code>    do 
      x <- f1
      y <- f2
      return $ x + y
</code></pre>
this is evaluated as applicative in same way.</p>
]]></description><pubDate>Sat, 19 Jul 2025 05:12:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=44612756</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44612756</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44612756</guid></item><item><title><![CDATA[New comment by raluk in "Asynchrony is not concurrency"]]></title><description><![CDATA[
<p>One thing that most languages are lacking is expressing lazy return values. -> await f1() + await f2() and to express this concurently requres manually handing of futures.</p>
]]></description><pubDate>Fri, 18 Jul 2025 20:46:38 +0000</pubDate><link>https://news.ycombinator.com/item?id=44609651</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44609651</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44609651</guid></item><item><title><![CDATA[New comment by raluk in "Lens: Lenses, Folds and Traversals"]]></title><description><![CDATA[
<p>Great exercise driven course is: <a href="https://github.com/system-f/lets-lens">https://github.com/system-f/lets-lens</a></p>
]]></description><pubDate>Sat, 05 Jul 2025 05:59:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=44470399</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44470399</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44470399</guid></item><item><title><![CDATA[New comment by raluk in "Lens: Lenses, Folds and Traversals"]]></title><description><![CDATA[
<p><a href="https://blog.jle.im/entry/lenses-products-prisms-sums.html" rel="nofollow">https://blog.jle.im/entry/lenses-products-prisms-sums.html</a></p>
]]></description><pubDate>Fri, 04 Jul 2025 18:39:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=44466874</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44466874</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44466874</guid></item><item><title><![CDATA[New comment by raluk in "OpenAI charges by the minute, so speed up your audio"]]></title><description><![CDATA[
<p>Our team is working with soniox.com They are the most acurate model that works real time.</p>
]]></description><pubDate>Fri, 27 Jun 2025 05:50:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=44394008</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44394008</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44394008</guid></item><item><title><![CDATA[New comment by raluk in "Japan's IC cards are weird and wonderful"]]></title><description><![CDATA[
<p>One problem with fast writing is that it requres more energy to transmit from reader to a card in order for a card that has no internal source of power, to toggle bits. It is harder compared to just reading a bit from a card. Additonaly it is tricky to implement trasaction with single write, given that data transfer can be interrupted (for example user removes card from RF field). I am not sure if single write is enough for making this robust/transactional. It also helps a lot if RFID antenna is well tuned. Proximity of metal and way it is mounted has a big impact, so it is important that RF antenna for reader is tuned for exact environment it is mounted in.</p>
]]></description><pubDate>Sat, 17 May 2025 13:15:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=44014087</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=44014087</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44014087</guid></item><item><title><![CDATA[New comment by raluk in "Spade Hardware Description Language"]]></title><description><![CDATA[
<p>How one writes circular circuit, for example stream of fibonnachi numbers or IIR filter? For IIR filter it would be nice if it has protoype like iir(sig : T, a : vec<T, N>, b : vec<T,M>) -> T</p>
]]></description><pubDate>Mon, 12 May 2025 15:59:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=43964485</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=43964485</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43964485</guid></item><item><title><![CDATA[New comment by raluk in "Performance optimization is hard because it's fundamentally a brute-force task"]]></title><description><![CDATA[
<p>For low level benchmarking papi <a href="https://icl.utk.edu/papi/" rel="nofollow">https://icl.utk.edu/papi/</a> is great tool. It provides access for counters like cache misses, branch misses and number of cycles.</p>
]]></description><pubDate>Tue, 29 Apr 2025 15:32:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=43834044</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=43834044</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43834044</guid></item><item><title><![CDATA[New comment by raluk in "mIRC 7.81"]]></title><description><![CDATA[
<p>I learned programming using mIRC scripting. There used to be bunch of quiz chaneles about trivia. I logged channel to collect questions and then wrote script that provided response after some time based on linear function k + n*len(response). That was my fist piece of software I wrote. mirc scrpting based on event system was super nice system to work with. Later I also wrote chat bot and i collected have some funny conversations with strangers.</p>
]]></description><pubDate>Fri, 18 Apr 2025 09:50:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=43726490</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=43726490</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43726490</guid></item></channel></rss>