Yeah but it’s not representing a known number - I would rather say it is a proof that the busy beaver function for BLC at 49 bits is higher than Graham’s number. The fact that it represents known numbers concisely is more interesting to me.
[1] https://github.com/tromp/AIT/blob/master/fast_growing_and_co...