-O2 vs -O3 adds
-fgcse-after-reload -fipa-cp-clone -floop-interchange -floop-unroll-and-jam -fpeel-loops -fpredictive-commoning -fsplit-loops -fsplit-paths -ftree-loop-distribution -ftree-partial-pre -funswitch-loops -fvect-cost-model=dynamic -fversion-loops-for-strides
I don’t think any of these optimizations require more modern hardware?
For what it’s worth, it seems like it’s this “journalist” trying to make a sensational headline
The researchers themselves very clearly just tried to see if it could happen in our reality
“We decided to look at the probability of a given string of letters being typed by a finite number of monkeys within a finite time period consistent with estimates for the lifespan of our universe,”