Author

Topic: [XPM] [ANN] Primecoin Release - First Scientific Computing Cryptocurrency - page 179. (Read 688812 times)

legendary
Activity: 980
Merit: 1000
Need a campaign manager? PM me
Got excited when a message popped up and then I realised I had started the CL client and had received the 1 CL giveaway.
sr. member
Activity: 388
Merit: 250
I'm mining since yesterday's start. But I have no luck yet, I didn't mine any XPM.
Are there any rich prime-donators?
AbjccCitKYV2nPbfqZycVt3GggB3bZ435G
sr. member
Activity: 294
Merit: 250
so anyone can give me tipps how i get this working on mac os x ?
full member
Activity: 182
Merit: 100
I'm mining with some cores, CPUs are burning


13:55:58

getprimespersec


13:55:58

0


?
newbie
Activity: 54
Merit: 0
This prime number calculation is interesting, but it doesn't seem like a game-changer to me. I mean it's not really that useful.

It is a little like landing on the moon.  We already knew we could probably land on another celestial body even before that.  And it was really not very useful for quite a while.  But it was still a huge step to prove we can actually land on the moon, because it opened the window of all possibilities.
sr. member
Activity: 350
Merit: 250
"Don't go in the trollbox, trollbox, trollbox"
2 hours in and I've mined my first block, 19.85 XPM Smiley

I didn't even have to stop my Photoshop editing either so my PPS was averaging about 160-180 while I was working.
member
Activity: 99
Merit: 10
It's the stock fan. I guess i should set the stock frequency too.
I had never really use the CPU at max before this coin.
Overclocking with stock cooler? Oh noo  Huh

^ this


I've got the Thermaltake Frio on two pcs and its pretty awesome.  Sitting at 43°C with 4 cores on the i5-2500k at 3.7 ghz with it after mining overnight.  Room got a little warm though...

I've also had luck with the (cheaper) Arctic Freezer 7 Pro.

full member
Activity: 322
Merit: 113
Sinbad Mixer: Mix Your BTC Quickly
Correct me if I am wrong but isn't there already an existing set of prime numbers that are known?

Would this not be applicable to the proof of work function here?

Perhaps I am thinking about it wrong. I read through Sunny's paper. Thanks Sunny for the document.

I dont seem to understand how your proof of work is not exploited by existing known prime numbers that could be easily ported into the hash function to generate blocks.

What am I missing?  Huh

This is a common misunderstanding about primes. Primes are very abundant per prime number theorem. There is no such thing as 'prime table' at the scale of a hundred digits, as there are too many of them, like 1 out of a couple hundreds.

So mining with some CPU cores, is it worth it at diff 7? You guys still getting something? Smiley
It's been at 7 since the start. Same chance as at launch.
full member
Activity: 182
Merit: 100
Correct me if I am wrong but isn't there already an existing set of prime numbers that are known?

Would this not be applicable to the proof of work function here?

Perhaps I am thinking about it wrong. I read through Sunny's paper. Thanks Sunny for the document.

I dont seem to understand how your proof of work is not exploited by existing known prime numbers that could be easily ported into the hash function to generate blocks.

What am I missing?  Huh

This is a common misunderstanding about primes. Primes are very abundant per prime number theorem. There is no such thing as 'prime table' at the scale of a hundred digits, as there are too many of them, like 1 out of a couple hundreds.

So mining with some CPU cores, is it worth it at diff 7? You guys still getting something? Smiley
legendary
Activity: 1205
Merit: 1010
Correct me if I am wrong but isn't there already an existing set of prime numbers that are known?

Would this not be applicable to the proof of work function here?

Perhaps I am thinking about it wrong. I read through Sunny's paper. Thanks Sunny for the document.

I dont seem to understand how your proof of work is not exploited by existing known prime numbers that could be easily ported into the hash function to generate blocks.

What am I missing?  Huh

This is a common misunderstanding about primes. Primes are very abundant per prime number theorem. There is no such thing as 'prime table' at the scale of a hundred digits, as there are too many of them, like 1 out of a couple hundreds.
legendary
Activity: 1246
Merit: 1000
The recompense seems to diminish overtime.

08/07/2013 01:31 - 20.32 xpm
08/07/2013 06:36 - 20.16
08/07/2013 07:23 - 20.13
08/07/2013 09:57 - 20.04
08/07/2013 13:13 - 19.89

That is supposed to happen. PPC uses the same minting model. Higher the difficulty less coins minted. reverse is true.

Code:
int64 static GetBlockValue(int nBits, int64 nFees)
{
    uint64 nSubsidy = 0;
    if (!TargetGetMint(nBits, nSubsidy))
        error("GetBlockValue() : invalid mint value");
    return ((int64)nSubsidy) + nFees;
}

// Get mint value from target
// Primecoin mint rate is determined by target
//   mint = 999 / (target length ** 2)
// Inflation is controlled via Moore's Law
bool TargetGetMint(unsigned int nBits, uint64& nMint)
{
    nMint = 0;
    static uint64 nMintLimit = 999llu * COIN;
    CBigNum bnMint = nMintLimit;
    if (TargetGetLength(nBits) < nTargetMinLength)
        return error("TargetGetMint() : length below minimum required, nBits=%08x", nBits);
    bnMint = (bnMint << nFractionalBits) / nBits;
    bnMint = (bnMint << nFractionalBits) / nBits;
    bnMint = (bnMint / CENT) * CENT;  // mint value rounded to cent
    nMint = bnMint.getuint256().Get64();
    if (nMint > nMintLimit)
    {
        nMint = 0;
        return error("TargetGetMint() : mint value over limit, nBits=%08x", nBits);
    }
    return true;
}
legendary
Activity: 2492
Merit: 1473
LEALANA Bitcoin Grim Reaper
The recompense seems to diminish overtime.

08/07/2013 01:31 - 20.32 xpm
08/07/2013 06:36 - 20.16
08/07/2013 07:23 - 20.13
08/07/2013 09:57 - 20.04
08/07/2013 13:13 - 19.89

That is supposed to happen. PPC uses the same minting model. Higher the difficulty less coins minted. reverse is true.
hero member
Activity: 752
Merit: 500
bitcoin hodler
This prime number calculation is interesting, but it doesn't seem like a game-changer to me. I mean it's not really that useful.
sr. member
Activity: 392
Merit: 250
The recompense seems to diminish overtime.

08/07/2013 01:31 - 20.32 xpm
08/07/2013 06:36 - 20.16
08/07/2013 07:23 - 20.13
08/07/2013 09:57 - 20.04
08/07/2013 13:13 - 19.89

Edit:  i got a new one !
08/07/2013 13:23 - 19.88

I don't think it's random, maybe it's explained in the paper?
legendary
Activity: 2492
Merit: 1473
LEALANA Bitcoin Grim Reaper
Correct me if I am wrong but isn't there already an existing set of prime numbers that are known?

Would this not be applicable to the proof of work function here?

Perhaps I am thinking about it wrong. I read through Sunny's paper. Thanks Sunny for the document.

I dont seem to understand how your proof of work is not exploited by existing known prime numbers that could be easily ported into the hash function to generate blocks.

What am I missing?  Huh
hero member
Activity: 756
Merit: 501
Found 6 blocks overnight with 6 cores of an i7 930, ~150 primespersec. Now nothing for a few hours.
legendary
Activity: 2100
Merit: 1167
MY RED TRUST LEFT BY SCUMBAGS - READ MY SIG
Tried mining for a laugh here with 7 cores, found 2 block in 1 hour. Am I just lucky?

Yes i think so Smiley

Also  my friend is pretty lucky too. His g2020 processor has found 3 blocks in the same time as my i5 3570 so anyone can have a chance even with a weaker cpu it seems Smiley
hero member
Activity: 602
Merit: 500
sooooo why does this not work on amazon ec2 instances? 

Works on EC2.. I found 1 block with Amazon. But i only ran them for an hour.
full member
Activity: 160
Merit: 100
Tried mining for a laugh here with 7 cores, found 2 block in 1 hour. Am I just lucky?
Jump to: