+1000

How's this one for innovation :

I will get people to buy Nibble , and the price  will rise.

{ revolutionary?}

To add to this idea, I'd like to see some sort of "feature list" that each coin offers, almost like a comparison full of green check marks and red X's, published in the forum, or on a wiki page somewhere. Worst thing to happen, is having a bunch of alt coins offering the same features, claiming to be better than one another. that's completely petty.

I want to see innovation laid out in a chart.

Anyone with me?

What your coins actually sold for....

11-Jul-13 00:46:53   0.00200000   1.85000000   0.00370000
11-Jul-13 00:46:54   0.00110005   42.20000000   0.04642211
11-Jul-13 00:46:56   0.00110001   5.95000000   0.00654506


Do I get a cut of the difference between what you thought you sold for and what you actually sold for?

AbPD4fktQq1tx7dmGwM2wXc9zqs1Qp2MRA   if you have any more xpm thanks

There was no trade executed for 0.0004...

while you're at it, do that with fontas's neck for all the shit he caused us

Here's one more to try, uses -O3 -mtune=i686, so optimized for a 686 architecture but should work in other architectures as well. As I said, I expect the -march=native version I released at first to be faster, IF it works for you.

https://www.dropbox.com/s/qhafd9cdfts6090/release6_tuned_for_i686.zip

Thanks for being cool!

Just a quick question. I don't know how fast this is yet but is it a winner for Ivy Bridge i3 i5 i7? I have an i3 3225

All right, here's a fixed version. Includes all dlls, shouldn't be crashing on exit, and should be following the blockchain properly. 

https://www.dropbox.com/s/6dwcc5p1koj86vz/release5.zip

Just tested the 3 new windows releases from anonppcoin, shinkicker and zalfrin. Zalfrins is the fastest but shinkickers didn't crash on exit.

 

try %appdata%/roaming/primecoin/primecoin.conf

Yup. And the bullshit like "I'm sure they banned EC2! Or it wouldn't be 'fair'!".

Stop being a nooby noob and learn to compile your software like real men do, instead of blindly accepting binaries from unknown users.

Another update from Sunny King is upcoming - not only will it bail out after max. 3 secs, it will also bail out if a new block has arrived in the meantime.
-> https://bitcointalk.org/index.php?topic=253662.msg2702001#msg2702001

And if shinkicker's still awake he may provide a compiled windows client :-)

Ok, so I'm probably hurting my income, but sharing some hints for optimizations:
A quick'n'dirty profiling run showed that we spend very much time in memory allocations, so I am trying to eliminate some of them.

-did the headerhash mod outlined earlier

-did the time limit on Weave() from Sunny King

-removed some printf's , especially
printf("MineProbablePrimeChain() : new sieve (%u/%u) ready in %uus\n", psieve->GetCandidateCount(), nMaxSieveSize, (unsigned int) (GetTimeMicros() - nStart));
from prime.cpp since it's the only call to the rather expensive GetCandidateCount

-after creating vPrimes array in prime.cpp, store vPrimes.size() in a static variably and replace all calls to it with the variable

-in prime.cpp, PrimeTableGetNextPrime and PrimeTableGetPreviousPrime: Use upper_bound/lower_bound instead of linear search:
// Get next prime number of p
bool PrimeTableGetNextPrime(unsigned int& p)
{
    std::vector<unsigned int>::iterator foundelement=upper_bound(vPrimes.begin(), vPrimes.end(),p);
    if (foundelement!=vPrimes.end()){
        p=*foundelement;
        return true;
    }
    return false;
}

// Get previous prime number of p
bool PrimeTableGetPreviousPrime(unsigned int& p)
{
    std::vector<unsigned int>::iterator foundelement=lower_bound(vPrimes.begin(), vPrimes.end(),p);
    if (foundelement!=vPrimes.end()){
        p=*--foundelement;
        return true;
    }
    return false;
}

- in prime.cpp, CSieveOfEratosthenes::Weave() :
Split the for loop into two for loops, one going up to nChainLength, the other one going up to 2*nChainLength
Thus, you can safe the first first if+for clause in the first loop and leave away the if, and leave the if+for completely away in the second loop.
Also,
if (((nBiTwinSeq & 1u) == 0))
...
if (((nBiTwinSeq & 1u) == 1u))

can be substituted by

if (((nBiTwinSeq & 1u) == 0))
....
else
.....


-prime.h: Removed nSieveSize and replaced all occurrences with nMaxSieveSize. Removed nSieveSize from the initializer as it's become obsolete.

-prime.h: Changed
<     std::vector<bool> vfCompositeCunningham1;
<     std::vector<bool> vfCompositeCunningham2;
<     std::vector<bool> vfCompositeBiTwin;
---
>     bool vfCompositeCunningham1[1000000];
>     bool vfCompositeCunningham2[1000000];
>     bool vfCompositeBiTwin[1000000];
Thus, we should save on quite a few mallocs.

Don't forget to initialize the array by adding the following below in place of the other initialization

+1