We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...