Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Is that last sentence provable? If so, that's an impressively-strong statement (to state that the provably-most-efficient mathematical-computation circuit designs are known).


Well, at least for reasonably big integers, it is.

There might be faster algos for super long integers, or minute implementation differences that add/subtract few kilogates.


> Well, at least for reasonably big integers, it is.

Big integer calculations are the bread and butter of GPUs now?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: