<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Light Cone Consistency: Closure, Ordering, and the Single-Observer Boundary · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2605.09114/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2605.09114/feed.xml" rel="self" type="application/rss+xml" /><item><title>Light Cone Consistency: Closure, Ordering, and the Single-Observer Boundary — mentioned by withinboredom</title><link>https://news.ycombinator.com/item?id=49026678</link><guid isPermaLink="false">urn:hackerpapers:mention:2605.09114:49026678</guid><pubDate>Thu, 23 Jul 2026 19:16:30 GMT</pubDate><description>&lt;p&gt;They are indeed quite challenging. We literally wrote a paper about it (https://arxiv.org/abs/2605.09114) ... you almost describe some of our original architecture too! You might find it interesting -- or not. https://getswytch.com&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2605.09114/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item><item><title>Light Cone Consistency: Closure, Ordering, and the Single-Observer Boundary — HN submission</title><link>https://news.ycombinator.com/item?id=48109042</link><guid isPermaLink="false">urn:hackerpapers:submission:2605.09114:48109042</guid><pubDate>Tue, 12 May 2026 14:43:15 GMT</pubDate><description>&lt;p&gt;Show HN: Self-hosted Spanner-like database that speaks Redis&lt;/p&gt;&lt;p&gt;Almost 10 years ago, I was working on two projects: a space game that simulated relativity and a &amp;quot;dead man&amp;#x27;s switch&amp;quot; in case I died. I realized two things back then: 1. If I wanted to leave a message for my son in 30 years, I couldn&amp;#x27;t make any assumptions about technology in the future. 2. No database is unkillable. Over the coming decade, I set out to figure out how to build a leaderless database that could go &amp;quot;holographic&amp;quot; -- any partition could create a completely independent cluster -- while simultaneously acting like any other database. It was a long journey with a lot of dead ends and…&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2605.09114/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item><item><title>Light Cone Consistency: Closure, Ordering, and the Single-Observer Boundary — HN submission</title><link>https://news.ycombinator.com/item?id=48105796</link><guid isPermaLink="false">urn:hackerpapers:submission:2605.09114:48105796</guid><pubDate>Tue, 12 May 2026 08:48:12 GMT</pubDate><description>&lt;p&gt;LCC: Toward a Unified Theory of Consistency in Message-Passing Systems&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2605.09114/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
