<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: smiths1999</title><link>https://news.ycombinator.com/user?id=smiths1999</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 31 Aug 2026 08:36:27 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=smiths1999" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Answered elsewhere but the tl;dr is lock the db file. The design is multiple readers, single writer.</p>
]]></description><pubDate>Thu, 27 Aug 2026 19:32:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=49470057</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49470057</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49470057</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Why not use something else? I wanted to build something from scratch.<p>What you've built with ArcadeDB is definitely impressive, but much larger scale that what I was trying to accomplish with this. Like the repo says, think sqlite but for graph dbs :)</p>
]]></description><pubDate>Thu, 27 Aug 2026 19:32:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=49470046</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49470046</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49470046</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Not comparable. Similar to Neo4j vs LatticeDB. Lattice's goals are simplicity, single file, super easy to start using. Surreal supports embedded mode, but my understanding is it is not a single file. Surreal supports a huge number of data models, Lattice is more focused. Surreal also appears to have a company behind it. Lattice is just me.<p>If you are looking for something lightweight and simple, choose Lattice. If you are an Enterprise looking for hosting, Enterprise support, and maybe a database that can handle all of your needs instead of a specific one, pick SurrealDB.<p>I hadn't heard of SurrealDB until your comment though, so take what I have to say here with a grain of salt.</p>
]]></description><pubDate>Wed, 26 Aug 2026 16:59:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49452336</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49452336</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49452336</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Just added file locking to avoid concurrent writers across processes in the latest release.</p>
]]></description><pubDate>Wed, 26 Aug 2026 13:17:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=49448617</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49448617</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49448617</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Thanks - appreciate the feedback! I wanted the README to be something you could quickly glance at, get a sense of the project and whether it's what you are looking for, and be done with it.</p>
]]></description><pubDate>Wed, 26 Aug 2026 12:57:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=49448297</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49448297</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49448297</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Thanks for sharing this. The lattice numbers are pretty close but my sqlite numbers are way off. I got a new computer since then so will remeasure.</p>
]]></description><pubDate>Wed, 26 Aug 2026 12:50:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=49448182</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49448182</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49448182</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>I started thinking more deeply about how I would actually do this today and it won't be as straight forward as I initially thought. Will keep it on the radar and see if I can figure out a clean way to implement. Great suggestions!</p>
]]></description><pubDate>Tue, 25 Aug 2026 22:52:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=49441775</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49441775</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49441775</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>I am in the final stages of adding this based on your comment. Just wrapping up doc updates and will push a new release with hot copy functionality tonight!</p>
]]></description><pubDate>Tue, 25 Aug 2026 22:51:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=49441760</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49441760</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49441760</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Within the same process it's enforced at the db level. After reviewing the code more I see we don't have a mechanism in place to manage safety across processes. Will add a file lock mechanism tonight. Great call out!<p>In general though, the goal for this was single writer multiple readers. That was a design decision to keep things simple.</p>
]]></description><pubDate>Tue, 25 Aug 2026 22:31:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=49441589</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49441589</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49441589</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>The permissions question is interesting. I think the answer depends on context. One approach would be to create some edge types `hasAccessTo` and `accessibleBy` that connect a user to a node. Then I'd create an edge type `childOf`. The rest is business logic. Permission checks can just traverse up to the first root node with permissions. The downside is this is all business logic, so can't really look at the database and understand this is how it works. Depending on the database you could create a function that returns permissions for any node, that encapsulates this logic.<p>Anyways, thanks for checking it out! Really appreciate it. Good luck with your project!</p>
]]></description><pubDate>Tue, 25 Aug 2026 22:18:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=49441458</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49441458</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49441458</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>very cool site!</p>
]]></description><pubDate>Tue, 25 Aug 2026 22:00:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=49441281</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49441281</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49441281</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Great question! Two reasons. One, I wanted to build something on my own from the ground up rather than contribute to an already established large project. For me, it's a better way to learn. Hopefully people find it cool and want to use it. But if the best that happens is it's just a fun project I built then that is just fine for me. Secondly, the data layouts are different. They are very similar in the single-file, graph db respect. But lattice is transactional and row oriented while kuzu is columnar.</p>
]]></description><pubDate>Tue, 25 Aug 2026 20:19:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=49440044</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49440044</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49440044</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Yes! This is something I've been thinking about quite a bit the past few weeks. We are going in this direction at work and I think graph storage is a natural way to think about this.</p>
]]></description><pubDate>Tue, 25 Aug 2026 19:31:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=49439391</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49439391</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49439391</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>I used claude extensively (as well as codex, I finding myself switching between the two every few months). How I used claude varied by the stage. I spent a lot of time initially going back and forth with claude on the idea, figuring out what exists, what would make this interesting, key features I wanted as a user and how to build something around that that made sense as a product.<p>The initial phases of building I would build out piece by piece. For example, building out the file system interactions I would have claude build a feature and explain how it worked in an educational manner (e.g., like it was a section in a book on latticedb internals). I would then read through the code. This was a great way to learn and build, simultaneously.<p>In the later stages, where the features and work was more complex, I would spend more time discussing, instructing, and verifying, but less time understanding the actual implementation. I'll give you an example. It's been a long time since I've handwritten SIMD code. I could try and review claudes output, but I am certain I'd miss any subtle bugs that may exist. I found it more productive to assume the code was right and focus on thinking about how I would verify that. Benchmarking, playing with latticedb, etc. were my primary tools for verifying the work. I could run a benchmark and see performance was great. Then I'd explore the test vectors and realize they were trivial, completely invalidating the benchmark results. So we would go back to the drawing board, create a new benchmark set, see results weren't great, and evaluate what was wrong with the implementation. Sometimes features would take days to get out just because of the iteration loop.</p>
]]></description><pubDate>Tue, 25 Aug 2026 19:30:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=49439378</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49439378</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49439378</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>Thank you!</p>
]]></description><pubDate>Tue, 25 Aug 2026 19:11:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=49439087</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49439087</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49439087</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>duckpgq is great. I'd say the tl;dr is duckpgq if you have tables you want to traverse like a graph sometimes, latticedb when graph traversal is the primary mechanism of querying.<p>One of the motivating use cases for me was experimenting with agentic memory. I use latticedb as the backing data store. Finding related memories is traversing the graph (kind of like graph RAG).</p>
]]></description><pubDate>Tue, 25 Aug 2026 19:06:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49439015</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49439015</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49439015</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>I like the aesthetics of this page. Very clean and visually appealing</p>
]]></description><pubDate>Tue, 25 Aug 2026 19:00:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=49438904</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49438904</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49438904</guid></item><item><title><![CDATA[New comment by smiths1999 in "Show HN: LatticeDB – Like SQLite but for graph databases"]]></title><description><![CDATA[
<p>I did some perf benchmarking with 1M nodes but I'm mostly using it at smaller scales for another project exploring agentic memory.<p>Most interesting part is a tough one. From a learning perspective the beginning was incredibly interesting because I was spending a lot of time learning about how other DBs work. Even something as relatively simple as writing to disk had a lot more complexity to it than I initially anticipated.<p>I used LLMs extensively in building this, and the other interesting part was seeing how they failed. I've always been a proponent that tests are no guarantee of quality code, and working with LLMs has only reinforced it. They often write superficial tests. Sometimes a suite of tests would pass, but when I would actually play around with the feature it was clearly broken. LLMs certainly enabled me to build something of this scope, but it was far from "build a graph DB and notify me when you are done"</p>
]]></description><pubDate>Tue, 25 Aug 2026 18:55:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=49438833</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49438833</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49438833</guid></item><item><title><![CDATA[Show HN: LatticeDB – Like SQLite but for graph databases]]></title><description><![CDATA[
<p>We have been using graph DBs more and more at work. I found them painful to work with locally and decided to try and build something better.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49437049">https://news.ycombinator.com/item?id=49437049</a></p>
<p>Points: 188</p>
<p># Comments: 54</p>
]]></description><pubDate>Tue, 25 Aug 2026 16:52:05 +0000</pubDate><link>https://github.com/jeffhajewski/latticedb</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=49437049</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49437049</guid></item><item><title><![CDATA[New comment by smiths1999 in "Inkling: Our Open-Weights Model"]]></title><description><![CDATA[
<p>If the company does any kind of work with the US Government it's far easier to just say no to Chinese-origin models rather than deal with all the overhead on the government contracts. Since just about every major tech company has US contracts they all have to be careful about the use of Chinese models.</p>
]]></description><pubDate>Thu, 16 Jul 2026 13:59:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=48934698</link><dc:creator>smiths1999</dc:creator><comments>https://news.ycombinator.com/item?id=48934698</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48934698</guid></item></channel></rss>