frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Show HN: Extend UI – open-source UI kit for modern document apps

https://www.extend.ai/ui
30•kbyatnal•3h ago•3 comments

Show HN: HelixDB – A graph database built on object storage

https://github.com/HelixDB/helix-db/tree/main
35•GeorgeCurtis•3h ago•21 comments

Show HN: macOS menu bar gauges for your Claude Code quota

https://github.com/grzegorz-raczek-unit8/claude-quota
54•grzracz•9h ago•34 comments

Show HN: I built a microlearning app to learn personal finance

https://finance.usescroll.app
4•maclinz•1h ago•2 comments

Show HN: Ustps (UDP Speedy Transmission Protocol Secure) and USSH

https://github.com/x1colegal/USTP-Secure
4•x1colegal•1d ago•2 comments

Show HN: Learn while you wait for your agents to code

https://github.com/get-foyer/foyer
5•dennis3124•2h ago•0 comments

Show HN: Gravity – Interactive solar-system simulator, from Newton to Einstein

https://qunabu.github.io/Gravity/
196•qunabu•1d ago•48 comments

Show HN: GentleOS – A pair of hobby OSes for vintage 32-bit and 16-bit PCs

https://github.com/luke8086/gentleos32
119•luke8086•3d ago•103 comments

Show HN: Social network where inviting someone makes you accountable for them

https://chirpper.com
7•Chirpper•4h ago•14 comments

Show HN: NBSDgames – 21 new, improved, original text games for Unix, DOS, Plan9

https://github.com/abakh/nbsdgames
2•abakh•4h ago•1 comments

Show HN: Resonate – Low-latency, high-resolution spectral analysis

https://alexandrefrancois.org/Resonate/
43•arjf•4d ago•17 comments

Show HN: Drift – an embedding-model upgrade should be a rotation, not a reindex

https://github.com/aayush4vedi/drift-spark
4•aayush4vedi•7h ago•1 comments

Show HN: A curated collection of simple datasets for machine learning

https://github.com/pplonski/datasets-for-start
4•pplonski86•5h ago•1 comments

Show HN: Performative-UI – A react component library of design tropes

https://vorpus.github.io/performativeUI/
1153•lizhang•2d ago•208 comments

Show HN: Construct SQL from table records by breaking down decision tree

https://github.com/rentruewang/inversql
3•rentruewang•5h ago•1 comments

Show HN: Camel Mono – a monospace font that makes camelCase easier to read

https://github.com/TJHdev/camel-mono
4•tjhdev•5h ago•0 comments

Show HN: A 150M model that extracts verbatim evidence spans for RAG, no LLM call

https://huggingface.co/KRLabsOrg/verbatim-rag-modern-bert-v2
5•justacoolname•2h ago•0 comments

Show HN: Nucleus – A security-hardened, Nix-native container runtime

https://github.com/sig-id/nucleus
32•0kenx•20h ago•11 comments

Show HN: A Bluesky client for PICO-8

https://picosky.vinnymac.dev/
3•vinnymac•6h ago•0 comments

Show HN: RiskKernel, kill -9 an AI agent and resume it without paying twice

https://riskkernel.com/
4•prashar32•6h ago•6 comments

Show HN: Cost.dev (YC W21) – making agents cost-aware and cheaper to call

https://cost.dev/
48•akh•6d ago•29 comments

Show HN: Learn from 30 historical figures, open source, nonprofit, self-hosted

https://github.com/chipmates/agoracosmica
43•micstradev•1d ago•22 comments

Show HN: Gitdot – A better GitHub. Open-source, written in Rust

https://gitdot.io/
320•baepaul•2d ago•301 comments

Show HN: Impress your boss with interactive Decision Tree Visualization

https://github.com/mljar/supertree
3•pplonski86•8h ago•0 comments

Show HN: Tapflow – self-hosted iOS/Android simulator streaming for mobile QA

https://github.com/jo-duchan/tapflow
4•duchanjo•9h ago•0 comments

Show HN: Open-source version of Anthropic's internal analytics engine

https://github.com/Kaelio/ktx
13•lucamrtl•1d ago•2 comments

Show HN: Maillune – Embeddable drag-and-drop email editor as a single component

https://www.maillune.com/
5•gustavssondev•22h ago•0 comments

Show HN: Command Center, the AI coding env for people who care about quality

https://www.cc.dev/
64•Darmani•1d ago•30 comments

Show HN: Lathe – Use LLMs to learn a new domain, not skip past it

https://github.com/devenjarvis/lathe
398•devenjarvis•3d ago•72 comments

Show HN: Mach – A compiled systems language looking for contributions

https://github.com/octalide/mach
31•octalide•1d ago•29 comments
Open in hackernews

Show HN: HelixDB – A graph database built on object storage

https://github.com/HelixDB/helix-db/tree/main
35•GeorgeCurtis•3h ago
Hey HN, it’s been just over a year since we launched HelixDB (https://news.ycombinator.com/item?id=43975423), a project a friend and I started in college. It’s an OLTP graph database built on object-storage, with native vector search and full-text search (FTS).

Why graph, vector and FTS? Graph databases provide a natural cognitive model for data, vectors allow for a semantic understanding of the entities and relationships in the graph, and FTS provides more specific filtering. Many AI-driven applications attempt to combine all of these functionalities by stitching together multiple disconnected systems, but even then there’s no native way to perform joins or queries that span all systems. You still need to handle this logic at the application level.

Helix started as a graph DB, but we moved to a hybrid graph/vector approach after attempting to build an AI memory system, which led us down the GraphRAG and HybridRAG rabbit hole, where we would need separate graph and vector databases.

We knew scalability would be a challenge at each stage of our product's development, however our initial focus this past year was to prove out the product through local deployments and was only meant to be run on a single node. Scaling graph DBs remained a difficult and expensive problem we’d have to solve later. Some common ways other graph DBs solve scaling is by duplicating entire datasets across distributed machines (extremely expensive per node), or by sharding the data.

Sharding databases is effective and affordable, however, graph data doesn’t have explicit partitions like relational databases do. For example, sharding a relational DB involves splitting up tables. When it comes to graph DBs, the edges can span across any of the partitions, and hopping across multiple machines when traversing nodes is ineffective and computationally expensive.

Replicating graph DBs for high availability and better throughput drastically increases the operational cost of the db and still has a limit of how big you can vertically scale. The workload that we’re used for requires storing a huge amount of data for agents, where only a subset of that data is ever needed at any one time. So rather than having the whole thing in memory, we can store it all in object-storage and get the bits we need when they’re needed.

Agents benefit from better context, which is achieved from more and better data (more relationships etc). By using S3 as the persistence/data layer there is no limit to how big the graph can be or how many relationships you can have, and we can scale to serve throughput and requests by horizontally spinning up nodes and caching relevant subsets of the graph on each node. This way, you get extremely low latency for “hot” data and a p99 of ~100ms for writes and ~50ms for reads from cold storage (S3). Plus you get the benefit of dirt cheap storage.

Workloads that HelixDB is currently supporting: - Huge amounts of data (TBs) from which the agents need to search and traverse over - Offering affordable graph storage for companies where cost of graph data is a bottleneck - Consolidating multiple databases, enabling AI agents to have autonomy over companies, helping them become more autonomous. - AI memory - Company brains

We’re currently working on our own generalised AI memory layer which will use HelixDB under the hood and be completely open-source. Also, we’re finishing up on pre-filtering for vector search which will allow you to pre-filter based on relationships in the graph, metadata, and sub-graphs. And lastly, GA cloud will be available in the coming weeks.

If you want to run Helix locally (either on-disk or in-memory), you can find more info on our github (https://github.com/HelixDB/helix-db) or via our docs (https://docs.helix-db.com/database/local-development). If you’re interested in getting started with our distributed cloud, please email us founders@helix-db.com.

Many thanks! Comments and feedback welcome!

Comments

brene•3h ago
How does this compare vs. Turbopuffer?
GeorgeCurtis•3h ago
We see comparable results for vectors and FTS.

For vector search we have warm and cold p99s of approx 20ms and 400ms respectively. For FTS, warm and cold query p99s of approx 15ms and 250ms respectively.

Both of these benchmarks were run on 1m docs.

mentioum•3h ago
We've been having some issues with intermittent performance on multi hop queries.

What's your p99 like for multi hops?

GeorgeCurtis•3h ago
In prod we see p99’s of <10ms ms for warm queries and around 50ms per hop for cold queries.
mentioum•2h ago
Hmmm... I'll get in touch. Got an email i can reach out to, there doesn't seem to be one listed on your website?

I'm more concerned about if the p99s stay consistent when things get spikey.

dgraph is fine otherwise...

GeorgeCurtis•10m ago
Sure! You can email me personally at george@helix-db.com
zw17•2h ago
If your use case is OLAP based, please check it out PuppyGraph. It’s a graph query engine that sits on top of your Lakehouse (no ETL required). Our benchmark has shown consistently that 10-hop queries across billions of edges in <2 seconds. Our customers including some most data demanding companies like Coinbase, Datadog, Palo Alto Network, Netskope, AMD, etc.
GeorgeCurtis•2h ago
PuppyGraph is a good fit for OLAP for sure.

We’re just two young founders sharing what we’ve been building, so I’ll take the drive-by competitor plug as a compliment :)

Definitely a different focus though. Helix is OLTP, built for operational graph + vector workloads, especially apps/agent memory where low-latency traversals and writes are concerned.

jauntywundrkind•29m ago
And is open source.
mentioum•2h ago
It's not, its actually our prod db with direct user usage - we self host a large dgraph cluster. We have a very large number of people manage their car and car histories with us and host a full replica of the UK MOT Database.

We're fine with clickhouse and redshift for the OLAP work we do. I've been looking at ParaQuery lately if I really want to speed that up.

GeorgeCurtis•2h ago
This sounds like a perfect usecase. Would love to learn more and see if we can help!

email us: founders@helix-db.com

maxrumpf•3h ago
does it support fts/vector on edges of the graph?
GeorgeCurtis•2h ago
Yes you can put vectors, full text data, secondary and range indexes on both nodes and edges.
raufakdemir•2h ago
what language does this support? cypher/gremlin?
GeorgeCurtis•2h ago
We don't support cypher or gremlin. We can

You can query HelixDB using JSON or directly in your programming language of choice by using our Rust, TypeScript, Go or Python SDKs. We’ve found AI is very good at working with the SDKs and JSON itself to query, making the development experience much better than before: https://docs.helix-db.com/database/querying

Bnjoroge•1h ago
congrats! how does this compare to turbopuffer, surreal or other multi-model ones built on object storage or not
GeorgeCurtis•17m ago
tpuffer is a vector/fts database. Surreal is a bit of an "everything database".

We're a graph database with vector and FTS capabilities. Our vector and FTS benchmarks are comparable with tpuffer, but you would primarily use us for building whole applications, knowledge graphs, or AI memory/retrieval. Anything that is relationship intense.

Let me know if this properly answers your question

cjlm•34m ago
Currently #5 on gdb-engines.com - definitely worth a look.
GeorgeCurtis•29m ago
yooo this is awesome. Didn't even realise :)
rajit•29m ago
when will the graph memory layer be available?
GeorgeCurtis•13m ago
We plan on launching end of month.