We consider the plurality consensus problem for population protocols. Here, n anonymous agents start each with one of k opinions. Their goal is to agree on the initially most frequent opinion (the plurality opinion) via random, pairwise interactions. Exact plurality consensus refers to the requirement that the plurality opinion must be identified even if the bias (difference between the most and second most frequent opinion) is only 1. The case of k = 2 opinions is known as the majority problem. Recent breakthroughs led to an always correct, exact majority population protocol that is both time- and space-optimal, needing O(logn) states per agent and, with high probability, O(logn) time [Doty, Eftekhari, Gasieniec, Severson, Uznanski, and Stachowiak; 2021]. Meanwhile, results for general plurality consensus are rare and far from optimal. We know that any always correct protocol requires ω(k2) states, while the currently best protocol needs O(k11) states [Natale and Ramezani; 2019]. For ordered opinions, this can be improved to O(k6) [Gasieniec, Hamilton, Martin, Spirakis, and Stachowiak; 2016].