[–] 26560437? ago (edited ago)
The issue here is that floating point arithmetic is not perfectly reversible. The exponent and mantissa are both variable and there are numbers without perfectly round representations which lead to an increase in Epsilon as the number of operations increases. Yeah, we can create a "probable" reversal but with the number of adjustments I've seen it's likely raised Epsilon really high.
The question is how much tolerance for error does an election need? If we cannot accept a single vote error then Epsilon is a serious factor. If not, we'd have to make the estimation so that Epsilon was minimized.
[–] 26556841? 1 point -1 points 0 points (+0|-1) ago (edited ago)
OP please stop talking out of your ass you're obviously a novice
For one, compiled code is harder to read but its still code. A sufficiently knowledgeable person can read it just fine.
For another, the much bigger issue is determining what actual binary was deployed to the machines.
Voting machines are heavily regulated so there are a lot of checks against stuff like this but obviously no system is perfect.
[–] 26556976? [S] 1 point -1 points 0 points (+0|-1) ago
You're not fucking reading 32 or 64 bit compiled code in 1's and 0's fuckwit.
[–] 26557019? 0 points 1 point 1 point (+1|-0) ago
No of course I wouldn't dumbass, I'd read it in hex.