[erlang-questions] web authentication

[Joe Armstrong]

2011/7/8 Jack Moffitt <jack@REDACTED>:
>> Actually I have implement RSA
>> and a few other things in pure Erlang using bignums - one property
>> of these is that they are slow - (which is desirable by point iii) above
>> I'd never thought that slowness could be an advantage.
>
> If you are interested in slowness being a feature, you should read the
> Bitcoin paper and the other related work on "forced work". It turns
> out to be a quite useful primitive for certain things. In Bitcoin for
> example, the forced work is also scalable, so the minting of new coins
> in the system happens at an approximately constant rate despite
> technology upgrades and the influx of new workers.
>
> jack.

Ummm - now wait a moment

I think I can prove that NP = P - Yes - Eureka

Unfortunately the margin isn't big enough ...

/Joe