User blog:QuasarBooster/Obfuscated Bashicu Matrix Sytem in Python

Hello again! I have yet another program which a) completely goes against good development principles and b) attempts to calculate numbers that exceed the memory capacity of any machine constructible in the known universe, let alone my dinky computer. That's right, more obfuscated googology! I recently became motivated to look into Bashicu matrices thanks to the user P進大好きbot suggesting that my method for Buchholz hydras looked similar to 2-row matrices. It's funny; I tried understanding the system before but it wasn't until programming Buchholz hydras then agressively re-minimzing my code that only now the system makes sense to me! Why do I always have to reinvent the wheel for myself to comprehend anything in googology? Haha. It also helped that 1-row Bashicu matrices behave very similarly to Beklemishev worms, which I've coded before. def BM(S,n): def L(A,B): i=0 l=len(B) while i<l and A[i]<B[i]:i+=1 return i<l and B[i] while S:   n*=n N=S.pop if max(N): i=len(S)-1 while i+1 and L(S[i],N):i-=1 if i+1: k=len(N) l=i-len(S) D=[(N[j]-S[i][j])*(0 not in N[:j+2])for j in range(k-1)]+[0] for t in range(n*-l):S+=S[l][j]+D[j]for j in range(k) return n This program currently measures 273 characters long which I'm quite proud of. As usual, I'm not certain if I've done it correctly but from the matrices I've tested it seems to behave as expected. I've condensed it with every method I can think of so far, but I still think there might be a little room for improvement. Lastly, I have just a couple questions about the current version of Bashicu matrices. Are there still issues about whether certain matrices terminate? From what I read on the article it seemed not fully resolved. Also, has it been confirmed that these things are capable of \(\psi(\psi_{I_\omega}(0))\) growth rates as the article claims?