[ANN][RIC] Riecoin: constellations POW *CPU* HARD FORK successful, world record

[Supercomputing]

Following up on my earlier tracing of offsets and difficulty, here's a new graph:

http://www.cs.cmu.edu/~dga/crypto/ric/diff_offset_2014_03_18.png

Looks like within a few days, the low-primorial miners will mostly be gone.

Supercomputing alluded to this, but I think it'll be interesting to see what happens with coprimes (offsets relative to the primorial) other than the first.  The ypool miner and mine both use only the first (+97 for 2310, and +16057 for big primorials).  But a00k's uses a different coprime for each worker.  I'm not sure I see a fundamental advantage to using the coprimes unless we start exhausting the 256 bit nonce space with large primorials and need to search more densely, but it seems like something to keep in mind.

I'll see if I can add a coprime-detector to my analysis code for some graphs next week.  That should also provide a better signature of the miner used to mine the block - interesting stuff.

All these primorial optimizations are assuming that all 'coprimes' as you say (I'm not sure it's the correct term, I'd call them 'remainders' since they are the remainder of the first prime of the sextuplet modulo the primorial) are equiprobable (ie sextuplets are distributed evenly amongst different remainders). It's logical to assume that, but I think it's not proven to be true. Some may give better performance than others - and it could be a big difference.
The safest approach would be to choose one at random and switch every few minutes or something. And of course the best would be to research if they are truly the same or not.

Some of you people thought your were mining this for the money? while you were distracted, I made you do science! ha!

I may be wrong if I missed something, and I completely agree with gatra.

a00k seems to be doing a lot of unnecessary work just to get to this:

Base_Target = {Current Target}
Sextuplet = 7273427997146573527660308536800543291038744551505285967246716372557017 <---- Static Sextuplet Origin (different for each thread)
Primorial = 179#

Then do something like this:

Remainder = Target  % Primorial
Remainder = Primorial - Remainder

Target_Offset = Remainder % Primorial
Target_Offset = Target_Offset + Sextuplet
Target_Offset = Base_Target + Target_Offset

Then your sieve array will represent:
Target_Offset + Primorial + Primorial + Primorial + ...

or

Target_Offset + (k * Primorial)

[1713559056]

1713559056

[1713559056]

1713559056

[1713559056]

1713559056

[1713559056]

1713559056

[1713559056]

1713559056

[1713559056]

1713559056

[gatra]

^^ I would assume the latter.

Can anyone provide an equation for calculating the estimated 4-chains required to find a 6-chain and thus mine a block?

it's possible but kinda tricky, one of the variables is how many primes you put in your sieve. Will think about it

[gatra]

ric.upcpu.com is also open for testing
They use xpt insted of stratum, so the optimized miners for ypool should work on the upcpu pool too

how do I transfer RIC coin into the wallet?

xptMiner.exe -o ricpool.upcpu.com -u RCeZfFMVsJqkeZi21w8j3U8mUhwzDW2T99.worker -p x -t 8

or

xptMiner.exe -o ricpool.upcpu.com -u RCeZfFMVsJqkeZi21w8j3U8mUhwzDW2T99 -p x -t 8

which one is correct?

in upcpu I think the former is valid
just make sure RCeZfFMVsJqkeZi21w8j3U8mUhwzDW2T99 is your address and you'll receive payouts there

[Bigtruck45]

Just to be a pedantic dick I don't think this is science, it's math (and math is most definitely not science), which is fine too.  

A mathematician and a scientist are given an identical problem: Prove that all odd numbers greater than 2 are prime numbers. They proceed:
Mathematician: 3 is a prime, 5 is a prime, 7 is a prime, 9 is not a prime - counterexample - claim is false.
Scientist: 3 is a prime, 5 is a prime, 7 is a prime, 9 is an experimental error, 11 is a prime, ...

[surfer43]

A mathematician and a scientist are given an identical problem: Prove that all swans are white
Mathematician: It is impossible to prove that!
Scientist: Well this swan is white, this one is too, and so is this one. I only see 3 swans. Proven!

[altcoinspool]

I just added RieCoin to our pool and would love some help testing it please ?

www.altcoinspool.com

Thanks.

Alt.

[northranger79510]

I just added RieCoin to our pool and would love some help testing it please ?

www.altcoinspool.com

Thanks.

Alt.

Thanks for adding Riecoin!

[surfer43]

how to calculate knumbers per second given 4-chains per second?

[TodaysCrypto]

Today's crypto coin is Riecoin!

http://www.todayscryptocoin.com/Riecoin/

@TodaysCrypto

 

[a00k]

Following up on my earlier tracing of offsets and difficulty, here's a new graph:

http://www.cs.cmu.edu/~dga/crypto/ric/diff_offset_2014_03_18.png

Looks like within a few days, the low-primorial miners will mostly be gone.

Supercomputing alluded to this, but I think it'll be interesting to see what happens with coprimes (offsets relative to the primorial) other than the first.  The ypool miner and mine both use only the first (+97 for 2310, and +16057 for big primorials).  But a00k's uses a different coprime for each worker.  I'm not sure I see a fundamental advantage to using the coprimes unless we start exhausting the 256 bit nonce space with large primorials and need to search more densely, but it seems like something to keep in mind.

I'll see if I can add a coprime-detector to my analysis code for some graphs next week.  That should also provide a better signature of the miner used to mine the block - interesting stuff.

All these primorial optimizations are assuming that all 'coprimes' as you say (I'm not sure it's the correct term, I'd call them 'remainders' since they are the remainder of the first prime of the sextuplet modulo the primorial) are equiprobable (ie sextuplets are distributed evenly amongst different remainders). It's logical to assume that, but I think it's not proven to be true. Some may give better performance than others - and it could be a big difference.
The safest approach would be to choose one at random and switch every few minutes or something. And of course the best would be to research if they are truly the same or not.

Some of you people thought your were mining this for the money? while you were distracted, I made you do science! ha!

I may be wrong if I missed something, and I completely agree with gatra.

a00k seems to be doing a lot of unnecessary work just to get to this:

Base_Target = {Current Target}
Sextuplet = 7273427997146573527660308536800543291038744551505285967246716372557017 <---- Static Sextuplet Origin (different for each thread)
Primorial = 179#

Then do something like this:

Remainder = Target  % Primorial
Remainder = Primorial - Remainder

Target_Offset = Remainder % Primorial
Target_Offset = Target_Offset + Sextuplet
Target_Offset = Base_Target + Target_Offset

Then your sieve array will represent:
Target_Offset + Primorial + Primorial + Primorial + ...

or

Target_Offset + (k * Primorial)

Not yet got into the point.... but I'm calling mines coprimes obviously because not requiring them to be primes.
  COPRIMES= { n | n, n+4, n+6, n+10, n+12, n+16 are relatively primes to P# }
I guess we can easily get many such 32-bit numbers, without obtaining them from true prime sextuplets... ??

[gatra]

I just added RieCoin to our pool and would love some help testing it please ?

www.altcoinspool.com

Thanks.

Alt.

please have in mind that algo is not scrypt as your site puts

[northranger79510]

Today's crypto coin is Riecoin!

http://www.todayscryptocoin.com/Riecoin/

@TodaysCrypto

 

This is great! Thank you

[gatra]

I guess we can easily get many such 32-bit numbers, without obtaining them from true prime sextuplets... ??

sure! you pick numbers that would form a valid 6tuple modulo each prime and then use the Chinese Remainder Theorem to get your remainder modulo your primorial (for example 1 mod 2, and 1 mod 3 gives you 1 mod 6). When numbers get larger, you'll have to do some trial and error in order to have your number fit in 32bits

[surfer43]

Are we ready for another difficulty jump? http://ypool.net/ric/stats_blocks

ypool is finding nearly all of the blocks 

[a00k]

>cell.md
Thank you for testing! Could you try setgenerate true 20 16, and raise the sieve size if you have RAM?
Or please catch me at ypool chat.

[dga]

I guess we can easily get many such 32-bit numbers, without obtaining them from true prime sextuplets... ??

sure! you pick numbers that would form a valid 6tuple modulo each prime and then use the Chinese Remainder Theorem to get your remainder modulo your primorial (for example 1 mod 2, and 1 mod 3 gives you 1 mod 6). When numbers get larger, you'll have to do some trial and error in order to have your number fit in 32bits

If I'm reading this correctly, I do it (not dynamically, but the static program I use to do it) by a quick recursive generator.  Pseudocode for clarity, not quite actual mpz names:

primorial = 2*3*5*7;
next_prime = 11;
polynomial = [7];
max_size = 10000;

for i = 0 ... #Pn {
   polynomial = add_to_poly(polynomial, next_prime, primorial, max_size);
   primorial *= next_prime
   mpz_nextprime(next_prime);
}

add_to_polynomail(cur_poly, next_prime, primorial, max_size):
  for i = 0 .. next_prime {
    for j = 0 ... sizeof(cur_poly) and sizeof(new_poly) <= max_size{
        candidate = (i*primorial) + cur_poly[j]
        new_poly += candidate if candidate not divisible by next_prime at any of its six positions
    }
  }
}

It's silly fast if you make the not divisible test fast (advance to candidate by using a pre-computed inverse divisor).  A single thread can generate 7038807 valid offsets for the 33rd primorial in about 6 seconds.  Which is probably enough.

[northranger79510]

Vault of Satoshi (a decently big Canadian exchange) just asked which coins to add. We should make Riecoin be noticed. I am against a whole bunch of exchanges adding us all at once but big exchanges could certainly help us. I'll be writing a nice long reply to them tomorrow but maybe others could today?

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

[Supercomputing]

Are we ready for another difficulty jump? http://ypool.net/ric/stats_blocks

ypool is finding nearly all of the blocks 

Yes, by a couple of people as usual with a lot of CPU power taking advantage of the low difficulty. But hopefully, RIC mining attracts more people so that the network difficulty can be truly sustained.

Happy mining to all - have to work on a special project until early May. 

[Aboroth]

Just to be a pedantic dick I don't think this is science, it's math (and math is most definitely not science), which is fine too.  

i am studding relativity right now. please come and tell me about math being DEFINITELY not science...

If you have a real thought, you can elaborate it and share it with the class. There's lots of explanations for why math is not science all over the intarwebs, you can go look yourself. I'm not hijacking this thread with a philosophical discussion, I just wanted to make a point that I see math being called a science a lot lately, and it isn't. It's nice for you that you are just now studying relativity. If you want to play the "appeal to authority game" to justify an argument, that's a pretty un-mathy thing to do.

I don't really care about the definition much, but what irks me is why math people (and people who suck at math but still post Neil Degrasse Tyson pics and say "science is cool, lolz") get offended about their maths being called "not science", but then don't have a solid and accurate definition of science on hand to justify why math is a science. This is especially funny when math is all about rigorous definitions, so it should be easy for them. It's relation to science is that it is used to describe scientific concepts, like a language.

Why do math people want math to be science, anyway? It isn't. That's not bad, better, or worse. It just is. Why is this a problem? Why is this offensive? If you are a mathematician, you can be proud of it. Math is used for lots of things, including modeling a lot of scientific things. But it isn't, in itself, science.

[tseug]

I tried to jump on this coin at launch but had endless issues compiling a 32 bit wallet. Gave up; time passes.

Now I'm trying again (missed the boat, I know) and while I have the wallet, I still need a miner but... nothing but problems

Code:

who_the_f@ckcares ~/Downloads $ unzip rminerd-sources.zip
who_the_f@ckcares ~/Downloads $ cd cpuminer/
who_the_f@ckcares ~/Downloads/cpuminer $ ./autogen.sh
bash: ./autogen.sh: Permission denied

Okay. That's common enough among the endless sporkcoins so...

Code:

who_the_f@ckcares ~/Downloads/cpuminer $ chmod +x autogen.sh
who_the_f@ckcares ~/Downloads/cpuminer $ ./autogen.sh
bash: ./autogen.sh: /bin/sh^M: bad interpreter: No such file or directory

Sure, CRLF/CR/LF/Encoding/whatever issues (I thought we were past this. It's LF and ASCII/UTF8 or STFU...) anyway, so lets just run the contents of autogen.sh manualy

Code:

who_the_f@ckcares ~/Downloads/cpuminer $ set -e
who_the_f@ckcares ~/Downloads/cpuminer $ aclocal
who_the_f@ckcares ~/Downloads/cpuminer $ autoheader
who_the_f@ckcares ~/Downloads/cpuminer $ automake --gnu --add-missing --copy
who_the_f@ckcares ~/Downloads/cpuminer $ autoconf

Fine. Then on one system

Code:

who_the_f@ckcares ~/Downloads/cpuminer $ ./configure
./configure: line 5611: syntax error near unexpected token `,'
./configure: line 5611: `LIBCURL_CHECK_CONFIG(, 7.15.2, ,'

And on another

Code:

who_the_f@ckcares ~/Downloads/cpuminer $ ./configure
configure: creating ./config.status
.in'ig.status: error: cannot find input file: `

Fun times. Love it when identical VM images act differently... anyway, some voodoo later (manual retyping of 2 lines on the latter system's (the easier fix) configure file)

Code:

who_the_f@ckcares ~/Downloads/cpuminer $ ./configure
who_the_f@ckcares ~/Downloads/cpuminer $ make
gcc -std=gnu99 -DHAVE_CONFIG_H -I. -pthread -fno-strict-aliasing     -g -O2 -MT rminerd-cpu-miner.o -MD -MP -MF .deps/rminerd-cpu-miner.Tpo -c -o rminerd-cpu-miner.o `test -f 'cpu-miner.c' || echo './'`cpu-miner.c
cpu-miner.c:41:17: fatal error: gmp.h: No such file or directory
 #include "gmp.h"
                 ^
compilation terminated.
make[2]: *** [rminerd-cpu-miner.o] Error 1
make[2]: Leaving directory `/home/who_the_f/Downloads/cpuminer'
make[1]: *** [all-recursive] Error 1
make[1]: Leaving directory `/home/who_the_f/Downloads/cpuminer'
make: *** [all] Error 2

YAY, more CRLF/CR/LF/Encoding/whatever bullshit... I give up. Please provide some unmangled sourcecode or at the very least, a 32 bit linux build.

I had faith in this coin from launch but it's just been a disappointment to me. Missed the boat due to, seemingly, dev's that take cross platform code, change a line or two (aka/ie, somenewcoin2.0), and completely fuck up all code portability. Seems like there's only a handful of actual developers in the cryptocurrency community that know what cross-platform/portable means.

If you have sympathy or pity this fool, RAvAQ3TrUNWrG2DDgfuPvdhzaiXtg2wjEu