Mulmuley's efficient generators conjecture for invariant rings

Let $W=(W_1,W_2,\ldots)$ be a sequence of representations, with $W_i$ an $\operatorname{SL}_{n_i}$-representation of dimension $N_i$. An arithmetic circuit succinctly encodes the generators of the invariant ring of an $\operatorname{SL}_{n_i}$-representation $W_i$ if, after assigning arbitrary complex values to its auxiliary variables, the resulting polynomials are invariants generating $\mathbb C[W_i]^{\operatorname{SL}_{n_i}}$ as a ring. Then there exists a polynomial $p$ and a sequence $C_i$ of arithmetic circuits of size $\leq p(n_iN_i)$ such that $C_i$ succinctly encodes the generators of the invariant ring of $W_i$. This conjecture asks for uniformly efficient descriptions of generators for invariant rings, a problem motivated by computational complexity and geometric complexity theory. The source states that the original conjecture for $\operatorname{SL}_n$ remained open, and that Oliveira stated its resolution as an open problem in December 2019.