Graph Hacks: Building Next-Gen RAG, an online hackathon powered by FalkorDB, September 2026, with $10,000 in prizes

Hackathon · with FalkorDB

Graph Hacks: Building Next-Gen RAG

Powered by FalkorDB’s Ultra-Fast Graph Engine

Rows show individual records. Graphs show how those records connect. If your data only makes sense one row at a time, you are missing the relationships that matter. Build with FalkorDB, model those connections properly, and turn them into a product that solves a real problem.

When
September 2026
Where
Online, from anywhere
Teams
Solo or up to 4 people
Prizes
$10,000 across three tracks

Registration open

One form, and you are in

Registration runs on a Google Form for this hackathon 👇

Register now
Cost
Free to enter
Team size
Solo, or up to 4
Takes
Under a minute

Looking for a team, or stuck on a graph model? Both servers are open for the whole event.

Registration

Register now

Registration is free and takes less than a minute. Enter on your own or with a team of up to four, and stay registered right up until submissions close.

  • Free to enter
  • Open worldwide
  • Online participation
  • One graph problem

    Pick a question that lives in the relationships, and build the product that answers it.

  • Solo or a team of four

    Enter on your own or with up to three others. Register once, either way.

  • Open worldwide

    Free to enter, online from anywhere, and no graph database experience assumed.

  • Three tracks

    Investigation and risk, agentic AI, or the GraphRAG SDK. Enter the one your idea fits.

See the full schedule

01 / The challenge

Make the graph do the reasoning

Build a working product on one graph problem. FalkorDB has to power a core feature of it, not decorate one.

The problem

Vector RAG breaks down on multi-step reasoning and on entities spread across documents. That is where models hallucinate.

The shift

Raw data structured as nodes and edges gives the model an explicit map to reason over.

The brief

Combine knowledge graphs, LLMs, and autonomous agents into something fast, accurate, and explainable.

Work the graph has to do

  • Finding a path

  • Tracing an impact

  • Grouping related records

  • Ranking a network

  • Searching connected data

Prize pool

$10,000

Split across three tracks. The final prize breakdown and the team prize policy are announced before the hackathon begins.

Track 01

Investigation and Risk

Build a product that uses connected data to investigate fraud, identity, claims, transactions, or other linked activity, and can show the reader how it reached its answer.

Key focus

  • Multi-hop link analysis
  • Identity resolution
  • Fraud ring detection
  • Evidence and case mapping
  • Explainable results

Prize details coming soon

Track 02

Best Agentic AI Use Case

Build autonomous AI agents, or a swarm of them, that use FalkorDB as a persistent cognitive memory layer: episodic, semantic, and procedural memory that survives across sessions.

Key focus

  • Multi-agent state sharing
  • High-concurrency memory lookups
  • Sub-millisecond traversals
  • Dynamic tool selection

Prize details coming soon

Track 03

Best Use Case of the GraphRAG SDK

Build production-grade, reliable data pipelines on the official open-source GraphRAG SDK.

Key focus

  • Ontology generated from raw docs
  • Incremental sync with apply_changes()
  • Hybrid vector, keyword, and Cypher retrieval
  • Multi-hop graph expansion
  • Verified source attribution

Prize details coming soon

02 / Why graphs

Some questions are about the connection

These are hard because the answer is spread across several relationships rather than sitting in any one record.

  • Which accounts share the same device?
  • What depends on a vulnerable package?
  • Which suppliers sit on the same delivery path?

As rows

logins

accountdevice
acct_18dev_a3
acct_42dev_a3
acct_77dev_b1
acct_91dev_a3
Four records, each one complete and each one uninteresting. The thing worth knowing is not in any single row.

As a graph

same four rows

:USEDacct_18acct_42acct_91acct_77dev_a3dev_b1
Three of those accounts sit on one device. Nobody had to run a report to see it, and that is the entire difference.

Pull a thread

tap a node

Three accounts land on one device. Follow one step further and both devices were seen at the same address, so the ring is larger than the table said it was.

The example is illustrative, but the shape is not. Every question worth asking on this page has the same one: the answer is spread across several relationships, and a graph database stores those relationships directly rather than rebuilding them with joins on every query.

03 / About the sponsor

Powered by FalkorDB

An open-source property graph database with the GraphRAG SDK, Cypher, sub-millisecond traversals, and clients for the stack you already use.

An open-source property graph database built for AI workloads, with support for the Cypher query language and traversals fast enough to sit inside an agent loop. Run it locally with Docker, or use FalkorDB Cloud and skip the setup entirely.

FalkorDB Browser is the visual side of it: create graphs, run queries, and see how the records you loaded actually connect.

Official clients

  • Python
  • Node.js
  • Java
  • Rust
  • Go
  • PHP
  • C#

Cypher

who shares a device

MATCH (a:Account)-[:USED]->(d:Device)<-[:USED]-(b:Account)
WHERE a.id < b.id
RETURN d.id AS device, collect(a.id) + collect(b.id) AS accounts
ORDER BY size(accounts) DESC
LIMIT 10

The middle of the first line is a drawing of the thing you are looking for. Two accounts, one device, arrows either side. That pattern is the query.

  • Start with the GraphRAG SDK

    Point it at your raw documents and it builds the graph: the ontology is generated for you, and retrieval runs across vector, graph, and keyword at once.

    • Graph from raw text
    • Automatic ontology
    • Hybrid search
    • Incremental sync
  • Memory for AI agents

    Sub-millisecond traversals make this a memory layer an agent can read and write on every step, and still find there on the next session.

    • Semantic memory
    • Episodic memory
    • Multi-agent state
  • Query with Cypher

    Create nodes and relationships, match graph patterns, follow paths, filter results, and return the data your application needs.

  • Run graph algorithms

    The traversals you would otherwise write yourself, already in the database.

    • Shortest path
    • PageRank
    • Centrality
    • Connected components
    • Community detection
  • Explore the graph

    Use FalkorDB Browser to run queries, inspect the data model, review results, and visualise how records connect.

  • Build with your stack

    Connect through the official clients, or through the AI framework you are already writing against.

    • Python
    • TypeScript
    • LangChain
    • LlamaIndex
    • DSPy

04 / FAQ

Got questions?

Who can participate?

The hackathon is open to developers worldwide. You can participate solo or with a team of up to four people.

Do I need graph database experience?

No. The getting started guide and the kickoff session cover the basics you need to begin.

Is FalkorDB mandatory?

Yes. FalkorDB must be the primary graph database, and it must support a central part of the product.

Where do I register?

Registration happens through the Google Form linked from the Register now button on this page. There is no account to create here.

Can I use any programming language?

Yes. You may use any language, framework, frontend, or deployment platform that works with your project.

Can I continue an existing project?

You may reuse general libraries, templates, and infrastructure. The submission and its main FalkorDB implementation must be new work completed during the event.

Can I use coding assistants?

Yes. You remain responsible for the code, architecture, security, and correctness of the project, and you must be able to explain what was built and why.

Does the project need to be deployed?

A live deployment is preferred. Projects that cannot be deployed must include complete local setup instructions and a working demo video.