Research

Research seriesL3offensive security

Adversarial Inputs and Jailbreaks: The Optimization View

A jailbreak is not a clever sentence but the solution to a discrete optimization problem over tokens. This threat lab formalizes the adversarial objective, derives gradient-guided coordinate search, explains transferability and universality as shared representation geometry, maps the jailbreak families to the single mechanism each exploits, and bounds what robustness can promise. Grounded in the primary adversarial-ML literature, each primitive paired with its defense.

Murali Chillakuru·5 articles
  1. 1
    The Adversarial Objective: Formalizing a Jailbreak as a Loss over the Input

    A jailbreak is not a clever sentence but the minimizer of a loss function over tokens — and seeing it that way is what makes it defensible.

  2. 2
    Greedy Coordinate Search: Why Token-Level Search Beats Naive Gradient Descent

    You cannot gradient-descend a sentence, but you can let the gradient nominate token swaps and keep the ones that actually lower the loss — and that footprint is what betrays the attack.

  3. 3
    Universality and Transfer: Shared Representation Geometry as the Reason Suffixes Move

    One optimized suffix can defeat many prompts and many models it never saw — and the reason is not luck but the shared geometry that similarly-trained models learn.

  4. 4
    A Taxonomy of Jailbreak Families: One Mechanism Behind Obfuscation, Role-Play, and Many-Shot

    The dozens of named jailbreak styles are surface variations on a single move — pushing the input into a region where the model's refusal probability is low.

  5. 5
    Robustness and Its Limits: Adversarial Training, Classifiers, and Why Provable Bounds Stay Small

    Every practical jailbreak defense raises the attacker's cost without closing the door, and the one method that offers a proof buys only a tiny certified radius — so defense is economics, not a wall.