<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>Fri, 03 Jul 2026 08:53:37 +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 "Sony Deletes 551 Movies PlayStation Owners Paid For"]]></title><description><![CDATA[
<p>In similar fashon in year 2009 Amazon deleted books from Kindle. One of them was 1984 from George Orwell.</p>
]]></description><pubDate>Wed, 01 Jul 2026 15:47:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=48748782</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=48748782</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48748782</guid></item><item><title><![CDATA[New comment by raluk in "Parallel Parentheses Matching"]]></title><description><![CDATA[
<p>This algebra is also called bicyclic semigroup <a href="https://en.wikipedia.org/wiki/Bicyclic_semigroup" rel="nofollow">https://en.wikipedia.org/wiki/Bicyclic_semigroup</a></p>
]]></description><pubDate>Fri, 26 Jun 2026 13:00:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=48686112</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=48686112</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48686112</guid></item><item><title><![CDATA[New comment by raluk in "Everything in C is undefined behavior"]]></title><description><![CDATA[
<p>In C / C++ there are two kinds of undefined behaviour. One is where there is written in standard what UB is. Another one is everthing else that is not in standard.</p>
]]></description><pubDate>Wed, 20 May 2026 06:49:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=48203996</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=48203996</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48203996</guid></item><item><title><![CDATA[New comment by raluk in "Understanding the Kalman filter with a simple radar example"]]></title><description><![CDATA[
<p>Spending few weeks trying to understand Kalman filterm,  I figured out that I need to understand all if the following:<p>1. Model of system<p>2. Internal state<p>3. How is optimal estimation defined<p>4. Covariance (statistics)<p>Kalman filter is optimal estimation of internal state and covariance of system based on measurements so far.<p>Kalman process/filter is mathematical solution to this problem as the system is evolving based on input and observable measurements. Turns out that internal state that includes both estimated value and covariance is all that is needed to fully capture internal state for such model.<p>It is important to undrstand, that having different model for what is optimum, uncertenty or system model, compared to what Rudolf Kalman presented, gives just different mathematical solution for this problem. Examples of different optimal solutions for different estimation models are nonlinear Kalman filters and Wiener filter.<p>---<p>I think that book on this topic from author Alex Becker is great and possibly best introduction into this topic. It has lot of examples and builds requred intuition really well. All I was missing is little more emphasis into mathematical rigor and chapter about LQG regulator, but you can find both of this in original paper by Rudolf Kalman.</p>
]]></description><pubDate>Thu, 09 Apr 2026 06:31:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=47700015</link><dc:creator>raluk</dc:creator><comments>https://news.ycombinator.com/item?id=47700015</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47700015</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>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></channel></rss>