Bumped this back down to High as it only affects top-level assumption. Below is some code which is not broken.
\begin{center} \begin{proof} \state{$\neg p\vee q$}{premise} \assumption{7}{ \state{$p$}{assumption} \assumption{3}{ \state{$\neg p$}{assumption} \state{$\bot$}{$\neg e$ 2, 3} \state{$q$}{$\bot e$ 4} } \assumption{2}{ \state{$q$}{assumption} \state{$q$}{copy 6} } \state{$q$}{$\vee e$ 1, 3-5, 6-7} } \state{$p\rightarrow q$}{$\rightarrow i$ 2-8} \end{proof} \end{center}
Bumped this back down to High as it only affects top-level assumption. Below is some code which is not broken.
\begin{center} $p$}{assumption } $\bot$} {$\neg e$ 2, 3} $q$}{$\ bot e$ 4} $q$}{assumption } $q$}{copy 6} $q$}{$\ vee e$ 1, 3-5, 6-7} $p\rightarrow q$}{$\rightarrow i$ 2-8}
\begin{proof}
\state{$\neg p\vee q$}{premise}
\assumption{7}{
\state{
\assumption{3}{
\state{$\neg p$}{assumption}
\state{
\state{
}
\assumption{2}{
\state{
\state{
}
\state{
}
\state{
\end{proof}
\end{center}