> whether a new algorithm or proof works is (usually) immediately evident upon implementation I would argue that this is a dangerous claim, because an algorith

> whether a new algorithm or proof works is (usually) immediately evident upon implementation I would argue that this is a dangerous claim, because an algorithm working generally is different from proof that it always works, and this can lead to serious issues. I would say that this is one of the big reasons peer review exists!