This is an audio briefing from Evidence Press on a research candidate about exact and pivotal e-values. Start with what an e-value is. It is a number that measures evidence against a hypothesis, like the payoff of a fair bet against it. If the hypothesis is true, its average is at most one, so large values are unlikely by chance. Its quality is how fast the evidence grows when the hypothesis is false. Often the hypothesis is not one distribution but a whole family, because of unknown nuisance parameters. Two stronger demands then make sense. An exact e-value averages exactly one under every member of the family. A pivotal e-value has the same distribution under every member, so its behaviour is known even though the true member is not. Zhang, Ramdas and Wang showed that for finitely many distributions such e-values exist exactly when the alternatives stay away from the span of the nulls, using optimal transport. For infinite families they conjectured a pivotal version. The new idea fits in one picture. Take any bounded score that averages zero under every null and at least a margin, delta, under every alternative. Flip a coin whose chance of heads rises with the score. It is fair under every null and biased under every alternative. Bet a fraction delta of your stake on heads. The result is exact and pivotal, and its growth is the best that delta alone can guarantee. This proves the sufficient half of the conjecture by a short route. The ingredients are classical; what is new is that they suffice for infinite families. There are two further findings. When e-values may be unbounded, pivotality can cost everything: there is an example where an exact e-value gains evidence but every pivotal one is powerless. And one sentence of the earlier paper, about tightness, is false; weak compactness is the right condition, and under it the conjecture holds both ways. Some limits matter. The results concern one observation, there is no general formula for the best pivotal e-value, and the separating score must still be found for each problem. This is an unrefereed candidate. Its checking is internal AI-assisted review and computation, not peer review. This briefing uses a synthetic voice and is not additional evidence.