Which of the 11 hash functions in X11 do you suppose is ASIC resistant?

If you can make an ASIC for each of the 11 hash functions, then you can trivially make an ASIC to do all of them at the same time...

Wait for a Cuckoo Cycle coin to come out (https://github.com/tromp/cuckoo).
That will run very well on your system...

I think you shouldn't even bother listing coins that use hashcash with some alternative,
easily computed hash function (or combination thereof), where there's no reason
whatsoever to think that it couldn't be implemented on a GPU...

Same as eventual us dollars.
Unlimited.

Like Cuckoo Cycle (https://github.com/tromp/cuckoo) ?

Not "anything". Just things that can run well on the average hardware and stay under the radar.

A proof-of-work system that uses 4+GB of memory will send the vast majority of botnet computers into swap-hell, resulting in

1) negligable hashing power
2) their owners realizing something is very wrong

Try "make java" on the latest version...

Notice any changes to https://github.com/tromp/cuckoo lately :-?

The verifier is done; I should have the solver ported soon as well.

Where is the option

I would claim all Icelander's coins as fast as possible to dump all of them immediatley.

? Why limit it to friends and family ?

Just a few more days of doubling in value and #1 Bitcoin will be toast :-)

Uhm, no.
Bitcoin never claimed to have a way of distributing millions of coins to a large population for free.

That is Aurora's main claim to fame. And it looks like an empty promise,
since as far as I can tell, such a distribution scheme is not actually feasible.

The big puzzle to me is: how can the airdrop possibly be implemented without government support?

How does he deal with a thousand people who all claim to be
Sigrun Gudmundsdottir with kennitala (national id) 120174-3389?

Have them all send in a copy of their passport and manually verify it?
I'm really curious how this is supposed to be implemented.

They only way I can see this working is if each Icelander has been issued a private key
and there is a public list of public keys (and each Icelander has been professionally
trained how to properly handle keys and keep their computer secure. Yeah right)

This is not a new idea. See
https://bitcointalk.org/index.php?topic=257135.0

As far as Amazon Web Services goes, a dual-cpu with each cpu having 8 hyper-threaded cores seems to be the best they can offer. So I cannot get beyond 32 threads with Amazon.

Some dual-cpus like the Xeon E7-2880 have as many as 15 (hyper-threaded) cores, which could provide 60 threads. To get beyond 60 threads requires a machine with a quad-cpu (Xeon E5-4XXX, E7-4xxx) or octa-cpu (E7-8xxx). Are any cloud computing providers offering these?

That's the number of runnable threads. The image shows 16 cores (real or virtual).
So out of those 1275, at most 16 can be running at any one time...

You mean 1 machine with 16 threads?
I'm sorry but that's not enough for my purposes.
I already tested up to 32 threads...

I'm trying to determine how parallelizable my Cuckoo Cycle proof-of-work is. See this thread for details if you have access to a computer with more than 32 threads:

https://bitcointalk.org/index.php?topic=485170.0

As developer of the Cuckoo Cycle proof of work, I'm trying to determine the maximum number of threads that can effectively work together on a single problem instance.

The largest machine I have access to has 32 threads (dual 8 core hyperthreaded) which yield a speedup of 16.7 over single-threaded runs. I'm very curious to know how many threads it takes to saturate the memory IO, so that additional threads bring no benefit.

The Makefile provided at https://github.com/tromp/cuckoo contains a basic speedup test
  make speedup.25
that only goes up to 8 threads, using 128MB instances (size 25).

If anyone has access to a Linux machine with more than 32 threads, could you please run a variation of that test with instances of size 28 (using 1GB) and as many threads as your system supports, and post a summary of your results?

For instance, if your system supports up to 60 threads, and you only want to try a subset of thread counts, you could do

for i in 1 2 8 16 32 48 52 56 60; do echo $i; cc -o cuckoo.spd -DNTHREADS=$i -DSIZEMULT=1 -DSIZESHIFT=28 cuckoo.c -O3 -std=c99 -Wall -Wno-deprecated-declarations -pthread -l crypto; time for j in {0..9}; do ./cuckoo.spd $j; done; done

Each single threaded run at size 28 takes about half a minute, so the entire test above should take under 15 minutes.

Any help is appreciated!

This quote is attributed to Einstein:

"“Two things are infinite, the universe and human stupidity, and I am not yet completely sure about the universe.”"

When can we expect a publication detailing your PoW?


But the latter is not as cost effective; it costs way more per thread and per GB of memory,
and thus gets handily beaten by a farm of pc's of the same total cost.