Constructive recognition conjecture for untwisted Chevalley groups in characteristic 2

Let $X$ be a black box group encrypting one of the untwisted Chevalley groups ${\rm G}(2^n)$, and let $u\in X$ be a given involution. Constructive recognition conjecture. There is a Monte-Carlo algorithm that constructs a polynomial-time, in $l(X)$, isomorphism

$$\Phi:{\rm G}(2^n)\longrightarrow X.$$

The running time of the algorithm is polynomial in $n$ and the Lie rank of ${\rm G}(2^n)$. This conjecture proposes a uniform constructive-recognition algorithm for the untwisted Chevalley groups in characteristic $2$; the supplied text gives no evidence that it has been resolved, so its status remains open.