<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: bibiver</title><link>https://news.ycombinator.com/user?id=bibiver</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 25 Apr 2026 17:39:44 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=bibiver" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Quixote: An open-source event indexer for EVM blockchains (Rust and DuckDB)]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/bilinearlabs/quixote">https://github.com/bilinearlabs/quixote</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46618789">https://news.ycombinator.com/item?id=46618789</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 14 Jan 2026 17:12:26 +0000</pubDate><link>https://github.com/bilinearlabs/quixote</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=46618789</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46618789</guid></item><item><title><![CDATA[New comment by bibiver in "Quixote: An open-source event indexer for EVM blockchains (Rust and DuckDB)"]]></title><description><![CDATA[
<p>Landing page with examples: quixote.bilinearlabs.io</p>
]]></description><pubDate>Tue, 13 Jan 2026 13:12:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=46600509</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=46600509</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46600509</guid></item><item><title><![CDATA[Quixote: An open-source event indexer for EVM blockchains (Rust and DuckDB)]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/bilinearlabs/quixote">https://github.com/bilinearlabs/quixote</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46600506">https://news.ycombinator.com/item?id=46600506</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Tue, 13 Jan 2026 13:11:54 +0000</pubDate><link>https://github.com/bilinearlabs/quixote</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=46600506</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46600506</guid></item><item><title><![CDATA[A single copy-paste error. $50M in USDT lost. The address poisoning scam]]></title><description><![CDATA[
<p>Article URL: <a href="https://twitter.com/bilinearlabs/status/2003446672979009761">https://twitter.com/bilinearlabs/status/2003446672979009761</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46368983">https://news.ycombinator.com/item?id=46368983</a></p>
<p>Points: 2</p>
<p># Comments: 5</p>
]]></description><pubDate>Tue, 23 Dec 2025 20:13:42 +0000</pubDate><link>https://twitter.com/bilinearlabs/status/2003446672979009761</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=46368983</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46368983</guid></item><item><title><![CDATA[Indexing 228M USDC events using DuckDB and Rust. What we found]]></title><description><![CDATA[
<p>Article URL: <a href="https://twitter.com/bilinearlabs/status/2000906807024472367">https://twitter.com/bilinearlabs/status/2000906807024472367</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46287782">https://news.ycombinator.com/item?id=46287782</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 16 Dec 2025 12:38:47 +0000</pubDate><link>https://twitter.com/bilinearlabs/status/2000906807024472367</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=46287782</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46287782</guid></item><item><title><![CDATA[New comment by bibiver in "Our modular, high-performance Merkle Tree library for Rust"]]></title><description><![CDATA[
<p>mmm most of writes and reads (if not all) are batched, meaning a leaf insert triggers just a batched write (containing all updates). maybe there is some fine tunning to be made.</p>
]]></description><pubDate>Wed, 22 Oct 2025 06:41:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=45665618</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=45665618</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45665618</guid></item><item><title><![CDATA[New comment by bibiver in "Our modular, high-performance Merkle Tree library for Rust"]]></title><description><![CDATA[
<p>by now sequential, but we are working on it. unsure though which concurrency model to choose tbh.</p>
]]></description><pubDate>Tue, 21 Oct 2025 17:24:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=45658596</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=45658596</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45658596</guid></item><item><title><![CDATA[New comment by bibiver in "Our modular, high-performance Merkle Tree library for Rust"]]></title><description><![CDATA[
<p>open to integrate async storage backends. do you have one in mind?
more benchmarks coming.</p>
]]></description><pubDate>Tue, 21 Oct 2025 17:16:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=45658454</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=45658454</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45658454</guid></item><item><title><![CDATA[New comment by bibiver in "Our modular, high-performance Merkle Tree library for Rust"]]></title><description><![CDATA[
<p>We've just released rs-merkle-tree, a Merkle tree crate designed with performance and modularity in mind. It comes with the following key features:<p>* Fixed depth: All proofs have a constant size equal to the depth of the tree. The depth can be configured via a const generic.<p>* Append-only: Leaves are added sequentially starting from index 0. Once added, a leaf cannot be modified.<p>* Optimized for Merkle proof retrieval: Intermediate nodes are stored so that proofs can be fetched directly from storage without recomputation, resulting in very fast retrieval times.<p>* Configurable storage and hash functions: Currently supports Keccak and Poseidon hashers, and in-memory, Sled, RocksDB, and SQLite stores.<p>The Rust ecosystem already offers several Merkle tree implementations, but rs-merkle-tree is built for a specific use case: append-only data structures such as blockchains, distributed ledgers, audit logs, or certificate transparency logs. It’s particularly optimized for proof retrieval, storing intermediate nodes in a configurable and extensible storage backend so they don’t need to be recomputed when requested.</p>
]]></description><pubDate>Tue, 21 Oct 2025 12:58:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=45655191</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=45655191</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45655191</guid></item><item><title><![CDATA[Our modular, high-performance Merkle Tree library for Rust]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/bilinearlabs/rs-merkle-tree">https://github.com/bilinearlabs/rs-merkle-tree</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45655190">https://news.ycombinator.com/item?id=45655190</a></p>
<p>Points: 144</p>
<p># Comments: 29</p>
]]></description><pubDate>Tue, 21 Oct 2025 12:58:57 +0000</pubDate><link>https://github.com/bilinearlabs/rs-merkle-tree</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=45655190</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45655190</guid></item><item><title><![CDATA[European Central Bank: Stablecoins and monetary sovereignty [pdf]]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.ecb.europa.eu//press/key/date/2025/html/ecb.sp251018~5280b1c98b.en.pdf">https://www.ecb.europa.eu//press/key/date/2025/html/ecb.sp251018~5280b1c98b.en.pdf</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45640673">https://news.ycombinator.com/item?id=45640673</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 20 Oct 2025 06:48:25 +0000</pubDate><link>https://www.ecb.europa.eu//press/key/date/2025/html/ecb.sp251018~5280b1c98b.en.pdf</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=45640673</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45640673</guid></item><item><title><![CDATA[New comment by bibiver in "IDEs we had 30 years ago and lost (2023)"]]></title><description><![CDATA[
<p>I saw this and was like, what?<p>> have we advanced much in 30 years?<p>IDEs have changed a lot, specially with AI-assisted ones. The author kind of acknowledges it, but imho it's a paradigm shift. Not just "a major difference".<p>> The only major difference that we are starting to see might be AI-assisted coding, but this is a feature mostly provided by a remote service, not even by the installed code!<p>Then I realized it’s a post from 2023. IDEs have changed a lot since then. Autocompletion has evolved from merely suggesting function names to completing 20 lines of code in the blink of an eye. It's great for productivity, but it also makes you lazy, to the point where you can't live without it.<p>In my opinion, software engineers should “disable the autopilot” from time to time, just like airline pilots must occasionally land without it. Otherwise, you end up becoming too dependent on it.</p>
]]></description><pubDate>Sat, 18 Oct 2025 16:57:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=45628720</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=45628720</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45628720</guid></item><item><title><![CDATA[Indexing Blockchain Events with Rust and Alloy]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.bilinearlabs.io/our-approach-to-indexing-evm-events/">https://blog.bilinearlabs.io/our-approach-to-indexing-evm-events/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44791900">https://news.ycombinator.com/item?id=44791900</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 04 Aug 2025 22:10:11 +0000</pubDate><link>https://blog.bilinearlabs.io/our-approach-to-indexing-evm-events/</link><dc:creator>bibiver</dc:creator><comments>https://news.ycombinator.com/item?id=44791900</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44791900</guid></item></channel></rss>