A proof of Holt's algorithm (Q921108)

Holt's algorithm was first described by \textit{D. F. Holt} several years ago [in Computational group theory, Durham 1982, 307-319 (1984; Zbl 0544.20004)]. The algorithm works on a p-group which has a base and a strong generating set that gives a subnormal series. The algorithm obtains a p-step central series and power commutator presentation for such a p-group. In the current paper not only is a proof of the algorithm presented, but also a more detailed description. To obtain the proof, the author views the algorithm as a conversion from a subnormal series to a p-step central series. The algorithm must also preserve a strong generating set for each group in the series, and a proof of this fact is given separately.