<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>jix.one</title>
<link>https://jix.one/</link>
<description>Blog by Jannis Harder</description>
<language>en</language>
<atom:link href="https://jix.one/index.xml" rel="self" type="application/rss+xml"/>
<item>
<guid>https://jix.one/uniformly-random-high-degree-regular-graphs-are-asymptotically-almost-surely-link-irregular/</guid>
<title>Uniformly Random High-Degree Regular Graphs are Asymptotically Almost Surely Link-Irregular</title>
<link>https://jix.one/uniformly-random-high-degree-regular-graphs-are-asymptotically-almost-surely-link-irregular/</link>
<description>A proof that uniformly random high-degree regular graphs are asymptotically almost surely link-irregular, providing another counterexample to a recent conjecture.</description>
<pubDate>Sun, 21 Dec 2025 18:00:27 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/proving-50-year-old-sorting-networks-optimal-part-2/</guid>
<title>Proving 50-Year-Old Sorting Networks Optimal: Part 2</title>
<link>https://jix.one/proving-50-year-old-sorting-networks-optimal-part-2/</link>
<description>Partial sorting networks and recursive minimal size computation.</description>
<pubDate>Wed, 01 Sep 2021 13:51:38 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/proving-50-year-old-sorting-networks-optimal-part-1/</guid>
<title>Proving 50-Year-Old Sorting Networks Optimal: Part 1</title>
<link>https://jix.one/proving-50-year-old-sorting-networks-optimal-part-1/</link>
<description>Introducing the problem of minimal size sorting networks and summarizing the previous state of the art.</description>
<pubDate>Tue, 04 May 2021 13:14:11 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/the-assembly-language-of-satisfiability/</guid>
<title>The Assembly Language of Satisfiability</title>
<link>https://jix.one/the-assembly-language-of-satisfiability/</link>
<description>How SAT solvers relate to higher level tools like SMT solvers.</description>
<pubDate>Sat, 03 Oct 2020 15:20:47 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/varisat-0.2.0-released/</guid>
<title>Varisat 0.2.0 Released</title>
<link>https://jix.one/varisat-0.2.0-released/</link>
<description>Release of my refactored CDCL based SAT solver written in Rust.</description>
<pubDate>Sat, 04 May 2019 10:15:51 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/refactoring-varisat-5-incremental-solving-and-proofs/</guid>
<title>Refactoring Varisat: 5. Incremental Solving and Proofs</title>
<link>https://jix.one/refactoring-varisat-5-incremental-solving-and-proofs/</link>
<description>Implementing assumption based incremental solving and proof logging, including LRAT proof logging.</description>
<pubDate>Fri, 26 Apr 2019 14:12:54 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/refactoring-varisat-4-heuristics/</guid>
<title>Refactoring Varisat: 4. Heuristics</title>
<link>https://jix.one/refactoring-varisat-4-heuristics/</link>
<description>Implementing heuristics for decisions, restarts and clause deletions. Also clause minimization.</description>
<pubDate>Thu, 21 Mar 2019 10:46:30 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/refactoring-varisat-3-cdcl/</guid>
<title>Refactoring Varisat: 3. Conflict Driven Clause Learning</title>
<link>https://jix.one/refactoring-varisat-3-cdcl/</link>
<description>Implementing search using decisions and clause learning.</description>
<pubDate>Mon, 18 Mar 2019 19:00:53 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/refactoring-varisat-2-clause-storage-and-unit-propagation/</guid>
<title>Refactoring Varisat: 2. Clause Storage and Unit Propagation</title>
<link>https://jix.one/refactoring-varisat-2-clause-storage-and-unit-propagation/</link>
<description>Implementing a clause allocator and watchlist based unit propagation.</description>
<pubDate>Sat, 02 Mar 2019 17:18:04 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/refactoring-varisat-1-basics-and-parsing/</guid>
<title>Refactoring Varisat: 1. Basics and Parsing</title>
<link>https://jix.one/refactoring-varisat-1-basics-and-parsing/</link>
<description>Refactoring my CDCL based SAT solver written in Rust.</description>
<pubDate>Sun, 03 Feb 2019 16:37:42 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/introducing-partial_ref/</guid>
<title>Introducing partial_ref</title>
<link>https://jix.one/introducing-partial_ref/</link>
<description>Inroducing a Rust library to work around interprocedural borrowing conflicts.</description>
<pubDate>Mon, 24 Dec 2018 13:07:10 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/encoding-matrix-rank-for-sat-solvers/</guid>
<title>Encoding Matrix Rank for SAT Solvers</title>
<link>https://jix.one/encoding-matrix-rank-for-sat-solvers/</link>
<description>Using a variant of the LU-decomposition to encode matrix rank constraints for SAT and SMT solvers.</description>
<pubDate>Fri, 07 Dec 2018 18:59:25 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/varisat-0.1.3-lrat-generation-and-proof-trimming/</guid>
<title>Varisat 0.1.3: LRAT Generation and Proof Trimming</title>
<link>https://jix.one/varisat-0.1.3-lrat-generation-and-proof-trimming/</link>
<description>Varisat can now directly output and trim LRAT proofs.</description>
<pubDate>Fri, 14 Sep 2018 12:54:02 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/introducing-varisat/</guid>
<title>Introducing Varisat</title>
<link>https://jix.one/introducing-varisat/</link>
<description>Inroducing a CDCL SAT solver written in Rust.</description>
<pubDate>Sun, 20 May 2018 13:42:27 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/not-even-coppersmiths-attack/</guid>
<title>Not Even Coppersmith’s Attack</title>
<link>https://jix.one/not-even-coppersmiths-attack/</link>
<description>Factoring ROCA weak RSA keys without using Coppersmith’s method.</description>
<pubDate>Sat, 23 Dec 2017 17:18:52 +0000</pubDate>
</item>
<item>
<guid>https://jix.one/pushing-polygons-on-the-mega-drive/</guid>
<title>Pushing Polygons on the Mega Drive</title>
<link>https://jix.one/pushing-polygons-on-the-mega-drive/</link>
<description>Write-up of the polygon renderer used for the Mega Drive demo “Overdrive 2”.</description>
<pubDate>Tue, 16 May 2017 18:37:45 +0000</pubDate>
</item>
</channel>
</rss>
