<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lud.cc ~ Ludwig's digital home</title><link>https://lud.cc/</link><description>Recent content on Lud.cc ~ Ludwig's digital home</description><generator>Hugo</generator><language>en-us</language><copyright>CC BY-SA 4.0</copyright><atom:link href="https://lud.cc/index.xml" rel="self" type="application/rss+xml"/><item><title>My photos on the internet</title><link>https://lud.cc/my-photos-on-the-internet/</link><pubDate>Thu, 20 Mar 2025 00:00:00 +0000</pubDate><guid>https://lud.cc/my-photos-on-the-internet/</guid><description>&lt;h1 id="context"&gt;Context&lt;/h1&gt;
&lt;p&gt;I used to take a fair amount of photos that I published on &lt;a href="https://www.flickr.com/"&gt;flickr&lt;/a&gt;. Years ago, I decided to reduce my footprint on the internet, therefore I removed them. I am glad to see some of them are used today while respecting the copyright &lt;a href="https://creativecommons.org/licenses/by/2.0/"&gt;CC BY 2.0&lt;/a&gt; (2.0 was the latest at the time photos were taken).&lt;/p&gt;
&lt;h1 id="what-i-found-on-the-internet"&gt;What I found on the internet&lt;/h1&gt;
&lt;ul&gt;
&lt;li&gt;Copenhagan, &lt;a href="https://www.watchpro.com/watches-of-switzerland-prepares-troops-for-european-incursion/"&gt;central retail district&lt;/a&gt; via watchpro.com&lt;/li&gt;
&lt;li&gt;Copenhagen, &lt;a href="https://www.archdaily.com/961484/houses-are-the-most-prevalent-form-of-monuments-in-conversation-with-bjorn-norgaard?ad_medium=gallery"&gt;Amagertorv Square&lt;/a&gt; via archdaily.com&lt;/li&gt;
&lt;li&gt;Copenhagen, &lt;a href="https://en.m.wikipedia.org/wiki/St._Mark%27s_Church,_Copenhagen"&gt;St. Mark&amp;rsquo;s Church&lt;/a&gt; via wikipedia.org&lt;/li&gt;
&lt;li&gt;France, &lt;a href="https://www.cityzeum.com/tourisme/ajaccio#intro"&gt;Ajaccio&lt;/a&gt; via cityzeum.com&lt;/li&gt;
&lt;li&gt;France, &lt;a href="https://www.goodfreephotos.com/france/corsica/shoreline-landscape-with-hills-in-corsica.jpg.php"&gt;Corsica&lt;/a&gt; via goodfreephotos.com&lt;/li&gt;
&lt;li&gt;France, &lt;a href="https://www.alpinepursuitstransfers.com/resorts/flaine/"&gt;Flaine&lt;/a&gt; via alpinepursuitstransfers.com&lt;/li&gt;
&lt;li&gt;France, &lt;a href="https://www.expedia.it/Parigi-Quartier-De-La-Maison-Blanche.dx553248635212953311"&gt;Quartier de la Maison-Blanche&lt;/a&gt; via expedia.it&lt;/li&gt;
&lt;li&gt;France, &lt;a href="https://tripomatic.com/es/poi/iglesia-de-nuestra-senora-de-loreto-poi:5031344"&gt;Église Notre-Dame-de-Lorette&lt;/a&gt; via tripomatic.com&lt;/li&gt;
&lt;li&gt;Japan &lt;a href="https://bokete.jp/boke/38710959"&gt;here&lt;/a&gt; and also &lt;a href="https://bokete.jp/boke/38655337"&gt;here&lt;/a&gt; via bokete.jp&lt;/li&gt;
&lt;li&gt;Russia, &lt;a href="https://ru.wikipedia.org/wiki/%D0%A1%D0%BA%D0%B2%D0%B5%D1%80_%D0%9C%D1%83%D1%81%D1%82%D0%B0%D1%8F_%D0%9A%D0%B0%D1%80%D0%B8%D0%BC%D0%B0_(%D0%A3%D1%84%D0%B0)"&gt;Сквер Мустая Карима, Уфа&lt;/a&gt; via wikipedia.org&lt;/li&gt;
&lt;li&gt;Russia, &lt;a href="https://odia.ig.com.br/mundo-e-ciencia/2018/12/5602995-incendios-matam-dez-pessoas-incluindo-seis-criancas-na-russia.html"&gt;Уфа&lt;/a&gt; via odia.ig.com&lt;/li&gt;
&lt;li&gt;&lt;a href="https://commons.wikimedia.org/w/index.php?search=ludwig+pacifici&amp;amp;title=Special:MediaSearch&amp;amp;type=image"&gt;Many photos&lt;/a&gt; via commons.wikimedia.org&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>RSS</title><link>https://lud.cc/rss/</link><pubDate>Tue, 11 Mar 2025 00:00:00 +0000</pubDate><guid>https://lud.cc/rss/</guid><description>&lt;h1 id="main-rss-feeds"&gt;Main RSS Feeds&lt;/h1&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://lud.cc/index.xml"&gt;Main feed&lt;/a&gt; (all the publications)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://lud.cc/tags/blogmark/index.xml"&gt;Blogmarks&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://lud.cc/tags/til/index.xml"&gt;TILs&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h1 id="more-rss-feeds"&gt;More RSS feeds&lt;/h1&gt;
&lt;p&gt;Each post on this website contains &lt;a href="https://lud.cc/tags"&gt;tags&lt;/a&gt;. There is an RSS feed&lt;sup id="fnref:1"&gt;&lt;a href="#fn:1" class="footnote-ref" role="doc-noteref"&gt;1&lt;/a&gt;&lt;/sup&gt; for each tag, with the following semantics:&lt;/p&gt;
&lt;div class="highlight"&gt;&lt;pre tabindex="0" style="color:#586e75;background-color:#eee8d5;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"&gt;&lt;code class="language-text" data-lang="text"&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;https://lud.cc/tags/{tag}/index.xml
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;div class="footnotes" role="doc-endnotes"&gt;
&lt;hr&gt;
&lt;ol&gt;
&lt;li id="fn:1"&gt;
&lt;p&gt;RSS version 2.0.&amp;#160;&lt;a href="#fnref:1" class="footnote-backref" role="doc-backlink"&gt;&amp;#x21a9;&amp;#xfe0e;&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;/ol&gt;
&lt;/div&gt;</description></item><item><title>Micromort</title><link>https://lud.cc/micromort/</link><pubDate>Tue, 18 Feb 2025 00:00:00 +0000</pubDate><guid>https://lud.cc/micromort/</guid><description>&lt;blockquote&gt;
&lt;p&gt;A micromort (from micro- and mortality) is a unit of risk defined as a one-in-a-million chance of death. Micromorts can be used to measure the riskiness of various day-to-day activities. A microprobability is a one-in-a million chance of some event; thus, a micromort is the microprobability of death.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;— &lt;a href="https://en.wikipedia.org/wiki/Micromort"&gt;Wikipedia&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;I discovered this word while reading this question:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;How many micromorts is a day in the life of a 90-year old?&lt;/p&gt;</description></item><item><title>Eager vs lazy evaluation</title><link>https://lud.cc/eager-vs-lazy-evaluation/</link><pubDate>Sat, 15 Feb 2025 00:00:00 +0000</pubDate><guid>https://lud.cc/eager-vs-lazy-evaluation/</guid><description>&lt;h1 id="til-boolthen_some-in-rust"&gt;TIL &lt;code&gt;bool::then_some&lt;/code&gt; in Rust&lt;/h1&gt;
&lt;p&gt;While participating in Advent of Code, I learned about &lt;a href="https://doc.rust-lang.org/std/primitive.bool.html#method.then_some"&gt;&lt;code&gt;bool::then_some&lt;/code&gt;&lt;/a&gt;. Because I tried to finish the problem on time, I did not read fully the documentation. I wrote a &lt;code&gt;get&lt;/code&gt; helper function to access an element in a 2D array. The code (simplified to 1D) looked like:&lt;/p&gt;
&lt;div class="highlight"&gt;&lt;pre tabindex="0" style="color:#586e75;background-color:#eee8d5;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"&gt;&lt;code class="language-rust" data-lang="rust"&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;&lt;span style="color:#859900"&gt;fn&lt;/span&gt; &lt;span style="color:#268bd2"&gt;main&lt;/span&gt;() {
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt; &lt;span style="color:#268bd2"&gt;dbg!&lt;/span&gt;(&lt;span style="color:#268bd2"&gt;get&lt;/span&gt;(&amp;amp;&lt;span style="color:#268bd2"&gt;vec!&lt;/span&gt;[&lt;span style="color:#2aa198;font-weight:bold"&gt;42&lt;/span&gt;, &lt;span style="color:#2aa198;font-weight:bold"&gt;51&lt;/span&gt;], &lt;span style="color:#2aa198;font-weight:bold"&gt;4&lt;/span&gt;));
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;}
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;&lt;span style="color:#859900"&gt;fn&lt;/span&gt; &lt;span style="color:#268bd2"&gt;get&lt;/span&gt;(&lt;span style="color:#268bd2"&gt;v&lt;/span&gt;: &lt;span style="color:#859900"&gt;&amp;amp;&lt;/span&gt;[&lt;span style="color:#859900;font-weight:bold"&gt;u8&lt;/span&gt;], &lt;span style="color:#268bd2"&gt;i&lt;/span&gt;: &lt;span style="color:#859900;font-weight:bold"&gt;usize&lt;/span&gt;) -&amp;gt; &lt;span style="color:#cb4b16"&gt;Option&lt;/span&gt;&amp;lt;&lt;span style="color:#859900;font-weight:bold"&gt;u8&lt;/span&gt;&amp;gt; {
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt; (&lt;span style="color:#268bd2"&gt;i&lt;/span&gt; &amp;lt; &lt;span style="color:#268bd2"&gt;v&lt;/span&gt;.&lt;span style="color:#268bd2"&gt;len&lt;/span&gt;()).&lt;span style="color:#268bd2"&gt;then_some&lt;/span&gt;(&lt;span style="color:#268bd2"&gt;v&lt;/span&gt;[&lt;span style="color:#268bd2"&gt;i&lt;/span&gt;])
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;}
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;It compiles fine, but it crashes:&lt;/p&gt;
&lt;div class="highlight"&gt;&lt;pre tabindex="0" style="color:#586e75;background-color:#eee8d5;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"&gt;&lt;code class="language-text" data-lang="text"&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;thread &amp;#39;main&amp;#39; panicked at src/main.rs:6:29:
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;index out of bounds: the len is 2 but the index is 4
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;Cargo-Process exited abnormally with code 101 at Thu Feb 13 21:04:58
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;What is wrong with this code?&lt;/p&gt;</description></item><item><title>Async Pipeline Pattern - Eager to work</title><link>https://lud.cc/async-pipeline-pattern/</link><pubDate>Tue, 28 Jan 2025 00:00:00 +0000</pubDate><guid>https://lud.cc/async-pipeline-pattern/</guid><description>&lt;p&gt;&lt;a href="https://github.com/alexpusch/rust-magic-patterns/blob/master/async-pipeline-pattern/Readme.md"&gt;Async Pipeline Pattern - Eager to work&lt;/a&gt;. I wrote a web crawler prototype and rediscovered the async pipeline pattern. It was interesting to see how this story explored the idea more thoroughly.&lt;/p&gt;
&lt;p&gt;A comment from Lobste.rs showed a different view on how to potentially improve it:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;One thing to keep in mind is that &lt;code&gt;FuturesUnordered&lt;/code&gt; is really just an executor like the one use to spawn tokio tasks, which can introduce its own issues when used with tokio. I would use tokio’s &lt;code&gt;JoinSet&lt;/code&gt; in this context, rather than &lt;code&gt;FuturesUnordered&lt;/code&gt;. In real code the image processing is presumably compute heavy and saving the image is presumably blocking file IO, so I’d actually use tokio’s &lt;code&gt;spawn_blocking&lt;/code&gt; to move both of those steps onto a background thread for compute work.&lt;/p&gt;</description></item><item><title>One Billion Row Challenge</title><link>https://lud.cc/one-billion-row-challenge/</link><pubDate>Mon, 13 Jan 2025 00:00:00 +0000</pubDate><guid>https://lud.cc/one-billion-row-challenge/</guid><description>&lt;p&gt;&lt;a href="https://curiouscoding.nl/posts/1brc/"&gt;One Billion Row Challenge&lt;/a&gt;. The problem easily fits in your head, allowing you to think about an initial algorithm. To discover which parts of the code are slow two methods are used : &lt;code&gt;flamegraph&lt;/code&gt; and &lt;code&gt;perf&lt;/code&gt;. The analysis demonstrates several well-known optimization techniques, such as:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Using bytes instead of UFT8 string&lt;/li&gt;
&lt;li&gt;Implementing faster hash functions, by dropping some characteristics (for example, resistance against &lt;a href="https://en.wikipedia.org/wiki/Collision_attack#Hash_flooding"&gt;HashDoS&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Utilizing Memory Map&lt;/li&gt;
&lt;li&gt;Leveraging SIMD&lt;/li&gt;
&lt;li&gt;Adding parallelization.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;While solving performance problems often involves trial and error, it&amp;rsquo;s refreshing to read about performance optimization in a language other than C or C++.&lt;/p&gt;</description></item><item><title>My approach to running a link blog</title><link>https://lud.cc/my-approach-to-running-a-link-blog/</link><pubDate>Thu, 09 Jan 2025 00:00:00 +0000</pubDate><guid>https://lud.cc/my-approach-to-running-a-link-blog/</guid><description>&lt;p&gt;&lt;a href="https://simonwillison.net/2024/Dec/22/link-blog/"&gt;My approach to running a link blog&lt;/a&gt; (&lt;a href="https://hachyderm.io/@mario/113775556310084460"&gt;via&lt;/a&gt;). The blogmarks idea is:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;publishing links (which I called “blogmarks”) with a title, URL, short snippet of commentary and a “via” link where appropriate.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;— Simon Willison&lt;/p&gt;
&lt;p&gt;I discovered this concept thanks to &lt;a href="https://mariosangiorgio.com/link/"&gt;Mario&lt;/a&gt;. He maintains a dedicated &lt;a href="https://mariosangiorgio.com/link/"&gt;page&lt;/a&gt; for it.&lt;/p&gt;
&lt;p&gt;This is an easy way to start writing about things I find interesting, remember them, and share them with others.&lt;/p&gt;</description></item><item><title>Blogroll</title><link>https://lud.cc/blogroll/</link><pubDate>Sun, 17 Mar 2024 00:00:00 +0000</pubDate><guid>https://lud.cc/blogroll/</guid><description>&lt;p&gt;Links to my favorite blogs&lt;sup id="fnref:1"&gt;&lt;a href="#fn:1" class="footnote-ref" role="doc-noteref"&gt;1&lt;/a&gt;&lt;/sup&gt;:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;A Smart Bear &lt;a href="https://longform.asmartbear.com/"&gt;https://longform.asmartbear.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Alice Ryhl &lt;a href="https://ryhl.io/"&gt;https://ryhl.io/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Alisa Sireneva &lt;a href="https://purplesyringa.moe/"&gt;https://purplesyringa.moe/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Allen Pike &lt;a href="https://allenpike.com/"&gt;https://allenpike.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;baby steps &lt;a href="https://smallcultfollowing.com/babysteps/"&gt;https://smallcultfollowing.com/babysteps/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Bartosz Ciechanowski &lt;a href="https://ciechanow.ski/"&gt;https://ciechanow.ski/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Bartosz Milewski&amp;rsquo;s Programming Cafe &lt;a href="https://bartoszmilewski.com/"&gt;https://bartoszmilewski.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Bert Hubert&amp;rsquo;s writings &lt;a href="https://berthub.eu/articles/"&gt;https://berthub.eu/articles/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Bob Nystrom &lt;a href="https://journal.stuffwithstuff.com/"&gt;https://journal.stuffwithstuff.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Bounded-Error Log &lt;a href="https://blog.vero.site/"&gt;https://blog.vero.site/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Brendan Gregg&amp;rsquo;s Blog &lt;a href="https://www.brendangregg.com/blog/"&gt;https://www.brendangregg.com/blog/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Daniel Lemire &lt;a href="https://lemire.me/en/"&gt;https://lemire.me/en/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;danluu &lt;a href="https://danluu.com/"&gt;https://danluu.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Distributed Systems Safety Research &lt;a href="https://jepsen.io/"&gt;https://jepsen.io/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Factorio Blog &lt;a href="https://www.factorio.com/blog/"&gt;https://www.factorio.com/blog/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;fasterthanli.me &lt;a href="https://fasterthanli.me/"&gt;https://fasterthanli.me/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Filip Hráček &lt;a href="https://filiph.net/"&gt;https://filiph.net/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Guillaume Endignoux &lt;a href="https://gendignoux.com/"&gt;https://gendignoux.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Ian Henry &lt;a href="https://ianthehenry.com/"&gt;https://ianthehenry.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;j3s.sh &lt;a href="https://j3s.sh/"&gt;https://j3s.sh/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Jon Gjengset &lt;a href="https://thesquareplanet.com/"&gt;https://thesquareplanet.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Julia Evans &lt;a href="https://jvns.ca/"&gt;https://jvns.ca/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Lalit Maganti &lt;a href="https://lalitm.com/"&gt;https://lalitm.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Mario Sangiorgio &lt;a href="https://www.mariosangiorgio.com/"&gt;https://www.mariosangiorgio.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;matklad &lt;a href="https://matklad.github.io/"&gt;https://matklad.github.io/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Matt Godbolt &lt;a href="https://xania.org/"&gt;https://xania.org/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Nolen Royalty &lt;a href="https://eieio.games/"&gt;https://eieio.games/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;notgull &lt;a href="https://notgull.net/"&gt;https://notgull.net/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;ntietz.com blog &lt;a href="https://ntietz.com/"&gt;https://ntietz.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Phil Eaton &lt;a href="https://notes.eatonphil.com/"&gt;https://notes.eatonphil.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Protesilaos Stavrou &lt;a href="https://protesilaos.com/"&gt;https://protesilaos.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Ragnar {Groot Koerkamp} &lt;a href="https://curiouscoding.nl/"&gt;https://curiouscoding.nl/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;rfc1149.net – Here be pigeons &lt;a href="https://rfc1149.net/"&gt;https://rfc1149.net/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Robert Heaton &lt;a href="https://robertheaton.com/"&gt;https://robertheaton.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Sean Goedecke &lt;a href="https://www.seangoedecke.com/"&gt;https://www.seangoedecke.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Signals and Threads &lt;a href="https://signalsandthreads.com/"&gt;https://signalsandthreads.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Some Random Website &lt;a href="https://a.exozy.me/"&gt;https://a.exozy.me/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Tom 7 Radar &lt;a href="http://radar.spacebar.org/"&gt;http://radar.spacebar.org/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;tonsky.me &lt;a href="https://tonsky.me/"&gt;https://tonsky.me/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Tristan Hume &lt;a href="https://thume.ca/"&gt;https://thume.ca/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Two-Wrongs &lt;a href="https://two-wrongs.com/"&gt;https://two-wrongs.com/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;web hole c9x.me &lt;a href="https://c9x.me/"&gt;https://c9x.me/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Without boats, dreams dry up &lt;a href="https://without.boats/"&gt;https://without.boats/&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;div class="footnotes" role="doc-endnotes"&gt;
&lt;hr&gt;
&lt;ol&gt;
&lt;li id="fn:1"&gt;
&lt;p&gt;As an &lt;a href="./subscriptions.opml"&gt;opml file&lt;/a&gt;.&amp;#160;&lt;a href="#fnref:1" class="footnote-backref" role="doc-backlink"&gt;&amp;#x21a9;&amp;#xfe0e;&lt;/a&gt;&lt;/p&gt;</description></item><item><title>About</title><link>https://lud.cc/about/</link><pubDate>Fri, 22 Jul 2011 00:00:00 +0000</pubDate><guid>https://lud.cc/about/</guid><description>&lt;h1 id="about-me"&gt;About me&lt;/h1&gt;
&lt;p&gt;Welcome to my digital &lt;code&gt;~&lt;/code&gt; (home), I am Ludwig Pacifici.&lt;/p&gt;
&lt;p&gt;I studied in &lt;a href="https://en.wikipedia.org/wiki/Bordeaux"&gt;Bordeaux&lt;/a&gt; and &lt;a href="https://en.wikipedia.org/wiki/Grenoble"&gt;Grenoble&lt;/a&gt;. I work as a software engineer specialized in finance, first in &lt;a href="https://en.wikipedia.org/wiki/Paris"&gt;Paris&lt;/a&gt; and now in &lt;a href="https://en.wikipedia.org/wiki/London"&gt;London&lt;/a&gt;. I used &lt;a href="https://isocpp.org/"&gt;C++&lt;/a&gt; for 8 years. I have 5 years of experience with &lt;a href="https://fsharp.org/"&gt;F#&lt;/a&gt; and &lt;a href="https://dotnet.microsoft.com/en-us/languages/csharp"&gt;C#&lt;/a&gt;. Now, I am working with &lt;a href="https://www.rust-lang.org/"&gt;Rust&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;I am interested in programming languages and compilers. Languages I like: Rust, &lt;a href="https://ocaml.org/"&gt;OCaml&lt;/a&gt; and Lisp dialects such as &lt;a href="https://www.gnu.org/software/emacs/manual/html_node/elisp/"&gt;Elisp&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;I enjoyed snowboarding mainly while I was a student. I did &lt;a href="https://www.mastersacademy.co.uk/"&gt;Kickboxing&lt;/a&gt;&lt;sup id="fnref:1"&gt;&lt;a href="#fn:1" class="footnote-ref" role="doc-noteref"&gt;1&lt;/a&gt;&lt;/sup&gt; for about 3 years. Now, I spend some of my free time cycling discovering new places near where I live.&lt;/p&gt;</description></item><item><title>Archive</title><link>https://lud.cc/archive/</link><pubDate>Fri, 22 Jul 2011 00:00:00 +0000</pubDate><guid>https://lud.cc/archive/</guid><description/></item><item><title>Résumé</title><link>https://lud.cc/resume/</link><pubDate>Fri, 22 Jul 2011 00:00:00 +0000</pubDate><guid>https://lud.cc/resume/</guid><description>&lt;h1 id="summary"&gt;Summary&lt;/h1&gt;
&lt;p&gt;Educated and experienced in Information Technology and finance, I designed software for G-Research, a leading quantitative research and technology firm, and Aquis, a pan-European equities exchange. I specialize in efficient and reliable software development, Linux-based operating systems, and system programming. I am inquisitive about distributed systems, programming languages and compilers.&lt;/p&gt;
&lt;h1 id="professional-experiences"&gt;Professional Experiences&lt;/h1&gt;
&lt;h2 id="onechronos--2025--london-gbr"&gt;&lt;a href="https://www.onechronos.com/" title="Go to official website"&gt;OneChronos&lt;/a&gt; ⋅ 2025 ⋅ London, GBR&lt;/h2&gt;
&lt;p&gt;&lt;em&gt;Keywords: rust, stock exchange, auctions, equities.&lt;/em&gt;&lt;/p&gt;
&lt;h2 id="sabbatical--2024"&gt;&lt;a href="https://en.wikipedia.org/wiki/Sabbatical" title="Sabbatical via Wikipedia"&gt;Sabbatical&lt;/a&gt; ⋅ 2024&lt;/h2&gt;
&lt;p&gt;&lt;em&gt;Keywords: family, rust.&lt;/em&gt;&lt;/p&gt;</description></item></channel></rss>