Definition
Plain language
A reward signal that's just yes or no — did it work or didn't it.
As stated in the literature
A scalar training signal taking values in {0,1}, typically used in RLVR pipelines where verifiable answer correctness is the only learning signal.
Also called: binary rewards
Why it matters: Binary rewards are simple and unhackable when the verifier is solid, but they make learning hard when most attempts either all succeed or all fail.
For example, in RL training on math problems, the model gets 1 if the final answer matches the ground truth and 0 otherwise, with no partial credit.
Heard on the show
“That structure is what makes binary rewards possible during RL, because you can do field-level exact matching instead of fuzzy text comparison.”Episode 059 — Firefly's Inversion: Building Verified Tool-Call Training Data by Working Backward