Step 2 in the Formal Verification in Paper A, the dependency chain is out of bound because of the arrow going left to right. Can we revise the chain to have the arrows go top to bottom (pointing down) instead. Also this is too long and go out of bound: B(n) = 4F(T)+4T 23Z2(T)+10.5 log(T+2)+48+40M0+2(e4+1) 7H(T)+2 DL(n)+IMaj(n)+1, ALso this: λn > 0 for all 1 ≤ n ≤ N1 := (T0−1)2 = 8 999 999 999 994 000 000 000 001 ≈ 9.0×1024. Can we revise somehow to have it in the paper margin.