Topic: [ANN][RIC] Riecoin: constellations POW *CPU* HARD FORK successful, world record - page 194. (Read 685381 times)

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.

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. 

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://bitcointalksearch.org/topic/vault-of-satoshi-asks-what-coins-do-you-want-to-see-519658

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.

>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.

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

ypool is finding nearly all of the blocks 

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

This is great! Thank you

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

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... ??

 

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

Thanks for adding Riecoin!

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

www.altcoinspool.com

Thanks.

Alt.

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!

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, ...

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

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

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)

^^ I would assume the latter. On the website, it says the former.

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