prob yes if RH is provable
1) we can binsearch shortest proof length in a compressed formal system, then the proof itself, up to ~10k bits (15 codegolf LOC)
2) to get more bits per bit, ask about shortest program that prints a proof, with constraints to make sure you can check it