← Latest papers
💻 computer science

SeedSmith: LLM-Driven Seed Synthesis for Directed Fuzzing

SeedSmith is an agentic LLM pipeline that synthesizes targeted initial seeds by iteratively resolving indirect calls and crash preconditions, thereby significantly accelerating directed fuzzing and enabling the discovery of previously unreachable vulnerabilities across diverse input formats.

Original authors: Junmin Zhu, Siyu Liu, Jie Hu, Fabio Gritti, Ati Priya Bajaj, Hulin Wang, Wenbo Guo, Tiffany Bao, Christopher Kruegel, Giovanni Vigna

Published 2026-07-13
📖 5 min read🧠 Deep dive

Original authors: Junmin Zhu, Siyu Liu, Jie Hu, Fabio Gritti, Ati Priya Bajaj, Hulin Wang, Wenbo Guo, Tiffany Bao, Christopher Kruegel, Giovanni Vigna

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to find a hidden treasure chest in a massive, dark castle. You have a robot (a "fuzzer") that can wander around, bump into walls, and try to open doors. Usually, the robot just wanders randomly, hoping to stumble upon the chest. But sometimes, you know exactly where the chest is (a specific "sink" function in the code), and you want the robot to go straight there. This is called Directed Fuzzing.

The problem? The robot often gets lost or stuck. Why? Because the map it uses is incomplete (it can't see secret passages behind locked doors), and even if it finds the room with the chest, it doesn't know the secret handshake required to open it. It just keeps poking the chest with a stick, hoping to break it, which takes forever.

Enter SeedSmith, a new system that acts like a super-smart detective before the robot even starts moving. Instead of letting the robot wander blindly, SeedSmith uses a special kind of artificial intelligence (an LLM) to do the detective work first.

The Two Big Problems SeedSmith Solves

1. The Invisible Map (Indirect Calls)
Imagine the castle has a hallway where the doors don't have names; they just have a note saying "Go to the door the guard points to." The robot's map only shows direct connections, so it thinks that hallway is a dead end. In the real world, this happens with "indirect calls" in computer code. The paper shows that without fixing this, the robot can never see the path to the treasure. SeedSmith's detective AI reads the code, figures out which guard points to which door, and draws the missing path on the map.

2. The Secret Handshake (Crash Preconditions)
Sometimes the robot finds the right room, but the chest is locked with a complex puzzle. Maybe you need to press three buttons in a specific order while holding a specific key. The robot's random poking (mutation) is like a monkey hitting keys on a piano; it might eventually hit the right note, but it could take a million years. SeedSmith's detective reads the instructions, figures out the exact combination, and builds a key that fits perfectly.

How SeedSmith Works: The Detective and the Builder

SeedSmith doesn't just guess; it works in two stages, like a two-person team:

  • The Analysis Agent (The Detective): This part of the system starts at the treasure chest and works backward. It uses a special tool to "search" the code, reading function bodies and type definitions just like a human security expert would. It doesn't just look at a static map; it asks questions like, "Who calls this function?" and "What values does this variable need?" It keeps digging until it finds the exact path and the exact conditions needed to trigger the crash.
  • The Seed Generation Agent (The Builder): Once the detective writes a report, the builder takes over. It writes a Python script to create the perfect "seed" (the starting input). If the treasure requires a complex image file or a specific network packet, the builder uses libraries (like a digital paintbrush) to construct it perfectly, rather than just throwing random bytes at it.

If the first attempt doesn't break the chest, the system checks the result, learns from the mistake, and tries again up to ten times until it gets it right.

What SeedSmith Proves (and What It Doesn't)

The researchers tested this on two big sets of challenges: Magma (23 specific bugs) and ARVO (115 real-world bugs from 26 projects).

The Results:

  • Speed: When using SeedSmith's seeds, the robots found crashes 11.51 times faster (on average) with one popular tool called AFL++, and 14.66 times faster with another called AFLGo, compared to using the default starting seeds.
  • New Discoveries: On the ARVO challenges, SeedSmith helped the robots find 16 bugs that they never found before, even after running for 24 hours. These bugs were in 10 different projects with very different file formats.
  • One-Shot Wonders: For some bugs, the seed SeedSmith built was so perfect that the robot triggered the crash immediately, before it even had a chance to mutate the input. This happened 5 times on the Magma set.

What SeedSmith is NOT:

  • It is not a magic wand that fixes the robot itself. The paper explicitly states that SeedSmith does not change how the robot (the fuzzer) works inside. It just gives the robot a better starting point.
  • It is not a replacement for all fuzzing. The paper notes that for some bugs, the robot still needs to do some work after the seed is given.
  • It does not claim to solve every problem. The paper admits that sometimes the robot still times out (takes too long), especially if the crash conditions are incredibly complex.

The Bottom Line

Think of SeedSmith as a GPS and a master keymaker combined. Before you send your robot into the dark castle, SeedSmith figures out the exact route and crafts the perfect key. The paper shows that this approach is measured and proven to make finding software bugs significantly faster and helps find bugs that were previously impossible to reach. It turns a game of blind luck into a game of smart strategy, allowing even general-purpose robots to act like directed treasure hunters.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →