Hum ...
If that holds true for all six bytes.
6 bytes 5 candidates per byte. 5^6 = 15,625 possible pins.
15,625 is a short list compared to 100^6.
VTL: How long would it take to test 15,625 possible pins generated from six sets of five candidates. ?
Hum ...
> 1000 pins in 640 ms, 1562 pins/s,RickHaleParker wrote: 08 May 2021, 14:56 VTL: How long would it take to test 15,625 possible pins generated from six sets of five candidates. ?
If the correct byte value always ends up a short list. Reduction by shortlisting might be the best compromise between speed and dependability.
But it does not. For the cmp+jmp instruction clusters on the same flash page/cache line/pipeline fetch only the first one yields a larger latency, the following has no latency spike, so it would never make it to the short list.
Then how do we ever get bytes B1 & B2?vtl wrote: 08 May 2021, 20:14
But it does not. For the cmp+jmp instruction clusters on the same flash page/cache line/pipeline fetch only the first one yields a larger latency, the following has no latency spike, so it would never make it to the short list.
Hey,T5Luke wrote: 24 Apr 2021, 08:08 Anybody has Dice, CODE and likes to try?
Only tested 1 time on bench and it worked. CEM allows only 100 write cycles so i dont like to do endless tests.
There are some small things i need to fix, if tests work 3 times i will upload here for all...
I figured that. I have too many pokers in the fire myself.vtl wrote: 10 May 2021, 08:16 Yeah, I'm sorry, my free time has evaporated recently. Everyone is welcome to tweak the code and submit improvements, it is opensource.