and they derived it we by reverse engineering a circuit lure about because circuit lower bounds are actually explicitly considering the trade-offs between the size of an input and the size of the computation you got a throw at the input to solve whereas Peters MP is actually not talking about this time at a fixed algorithm that's gonna work on all inputs okay and so the universe turns out stores a less than 10 to the 125 bits this is the this is the famous bekenstein bound in 1970s let's derive from that and so what