[omeid2]

> Such an attack doesn't exist.

As far as we know.

> Any such attack would also become feasible with twice the budget.

Assuming that the attack yields to parallel computing and scales linearly with more cpu/cores, because linear programming is bound to current compute capabilities and then theoretical limits like Bremermann's limit and Margolus–Levitin theorem.

[fwip]

Yeah, assuming these true things.

[omeid2]

Assuming the parallelism of an algorithm that you know nothing about is beyond foolish.

[geofft]

Right, which is why we know things about the algorithm.