hnpl

3 ms·

1. 1.▲
   by hnpl 2y ago

   I'd love to see the performance data before judging whether it is a good idea. There's no information on the branch prediction penalty of this approach as well. Anyway, I think the intuition of this approach is to aggressively fet
2. 2.▲
   by hnpl 3y ago

   Ah, another key is to change R12 to a number that is not divisible by 4. This is because every instruction is 4 bytes and the most significant bit is always 1. I got around 2 billon a couple of times but the average is quite low ;)
3. 3.▲
   by hnpl 3y ago

   I really like the concept! The key to achieve high scores seems to be writing 0 to PC. The reason is the binary code of new instructions will be "added" to the memory region that is visible on the right, then we can manipulate R12