← All speakers

Bio, Work & Ideas

Daniel Chalef

Conference affiliation: Founder and CEO · Zep · 2026

Daniel Chalef is the founder and chief executive of Zep AI and a creator of Graphiti, an open-source framework for building temporal knowledge graphs. His work addresses a central weakness of AI agents: remembering information without understanding whether it is relevant, current or trustworthy.

Originally from South Africa, Chalef founded KnowledgeTree, an enterprise document-management and sales-enablement company, serving as chief executive and chief technology officer. He subsequently led marketing at Domino Data Lab and held senior data-science and corporate-development roles at SparkPost. Those experiences spanned enterprise software, data infrastructure and the practical demands of selling technical products to businesses.

Chalef founded Zep AI in 2023; the company joined Y Combinator’s Winter 2024 batch. His early writing on hybrid search emphasized using metadata and business-specific filters to retrieve useful information from conversations. That approach evolved into Graphiti and a 2025 research paper, coauthored with Preston Rasmussen, Pavlo Paliychuk, Travis Beauvais and Jack Ryan, describing temporal knowledge graphs that combine conversational history with structured business data.

  • Business relevance is not semantic similarity. Vector search can mistake a dog named Melody for useful information about music. Chalef’s domain-aware agent memory instead models application-specific entities and relationships: a financial coach can retrieve income, debts and goals using typed schemas, business rules and targeted graph searches.
  • Temporal knowledge graphs preserve changing facts. Graphiti tracks when relationships become valid or obsolete, allowing agents to distinguish current circumstances from historical ones. Its retrieval combines graph traversal, full-text search and vector similarity.
  • Source provenance makes synthesized facts accountable. A patient’s apparent allergy might originate in a clinical record, laboratory report or unverified intake form. Chalef’s knowledge-graph provenance architecture links derived claims to their source episodes, retains lineage when identities merge and records when newer information invalidates earlier claims.
  • Trust and deletion depend on context. An allergy warning might warrant attention when any source supports it, while procedural consent may require independently verified records. Explicit source links also enable selective deletion: a claim survives when other records support it and disappears when its final supporting source is removed. Chalef favors deterministic retrieval and deduplication wherever they can reduce the expense and unpredictability of additional model calls.

His independently maintained mrfparse, a Go parser for healthcare price-transparency files, extends his interest in making complicated real-world information structured and operationally useful.

Read the topics behind these talks

3 conference talks

Key ideas

Scroll to read ↓

A fact in agent memory is only useful if its origins survive synthesis, entity merges, contradictions and deletion. Graphiti models that changing evidence as part of the graph.

  • Where did this fact come from?
    0:20 ↗
  • A source pointer becomes an evolving set
    2:58 ↗
  • Keeping lineage correct as the graph changes
    4:13 ↗
  • Source metadata does not decide policy
    6:16 ↗
  • Deleting a source without deleting every derived fact
    8:54 ↗
  • Build lineage into the data structure
    10:19 ↗
  • Where provenance lives and how agents reach it
    12:34 ↗
  • From an episode to a changing fact
    14:29 ↗
  • The provenance burden of file-based memory
    17:41 ↗
  • Extract together, then examine why things changed
    19:19 ↗

Key ideas

Scroll to read ↓

Graph-backed memory lets agents retain facts, reuse each other’s work, and retrieve domain-specific context—but relevance, aging, and access boundaries still need explicit design.

  • How will AI systems communicate?
    0:28 ↗
  • From stored data to preserved relationships
    5:13 ↗
  • A graph that agents read and write
    17:34 ↗
  • Recall before answering, record after answering
    23:09 ↗
  • Why a dog named Melody appears in music memory
    27:35 ↗
  • Typed memory for a finance coach
    32:06 ↗
  • Remembering what happened in a shell
    35:11 ↗
  • Testing memory while agents change it
    40:43 ↗
  • When a memory stops being useful
    45:57 ↗
  • Sharing memory without sharing everything
    47:42 ↗
  • The theoretical question remains open
    49:19 ↗

Key ideas

Scroll to read ↓

A media assistant that recalls a dog named Melody when asked for favorite tunes exposes the gap between semantic similarity and domain-aware agent memory.

  • What should an assistant remember?
    0:00 ↗
  • Why Melody appears among favorite tunes
    2:28 ↗
  • Give the finance coach explicit business objects
    4:13 ↗
  • Retrieve by type, then register the ontology
    5:27 ↗
  • Follow a new expense into memory
    5:58 ↗

References