The big problem for making pool is shares check....
Example: If you mine 9-er chain and submit 6-er chains as share you'll get about 20 6-er chains in a hour.
If i use same block data and replace in miner to search for 6-er chains you'll find 200-300 6-er chains in a hour
why ? well sieve is working like this ... it tryes sieve out all numbers that definitly don't make 9-er chain, this means if it makes 6-er chain but next number in chain is devided by any prime of primes in the sieve-check it will don't ever bother with check this chain, so no share.
The pool should tell client exactly where to search... like this ...
search with hash XXXX, with primorial multiplier YY, in the range of multipliers [NNN-MMM](bounds for min and max of Sieve) with exactly check of min (2.....XXXX) primes.
The checking of share is problem .... you have to check would be this chain sieved out, if it's so - this share is illegal.
so this means
you have to factorize all next Numbers from the share chain ( numbers if it would be 7-er, 8-er,9-er chain), and check they dividable by primes from [2....XXXX]. It isn't trivial and means really a lot of work for pool software ... I have no idea how make it better atm, probably take 7-er, 8-er chains as share ...
I hope i've made myself understandable, my english isn't that good.
P.S. i think this is the one of the causes that Ypool doesn't work good for really miners.
Example: If you mine 9-er chain and submit 6-er chains as share you'll get about 20 6-er chains in a hour.
If i use same block data and replace in miner to search for 6-er chains you'll find 200-300 6-er chains in a hour
why ? well sieve is working like this ... it tryes sieve out all numbers that definitly don't make 9-er chain, this means if it makes 6-er chain but next number in chain is devided by any prime of primes in the sieve-check it will don't ever bother with check this chain, so no share.
The pool should tell client exactly where to search... like this ...
search with hash XXXX, with primorial multiplier YY, in the range of multipliers [NNN-MMM](bounds for min and max of Sieve) with exactly check of min (2.....XXXX) primes.
The checking of share is problem .... you have to check would be this chain sieved out, if it's so - this share is illegal.
so this means
you have to factorize all next Numbers from the share chain ( numbers if it would be 7-er, 8-er,9-er chain), and check they dividable by primes from [2....XXXX]. It isn't trivial and means really a lot of work for pool software ... I have no idea how make it better atm, probably take 7-er, 8-er chains as share ...
I hope i've made myself understandable, my english isn't that good.
P.S. i think this is the one of the causes that Ypool doesn't work good for really miners.