Topic: Nexus - Pure SHA3 + CPU/GPU + nPoS + 15 Active Innovations + More to Come - page 304. (Read 785514 times)

{
	"connections" : 
	[
		{
			"url" : "127.0.0.1:9325",
			"user" : "x",
			"password" : "x"
		}
	],
	
	"algorithm" : "sk1024_djm",
	"gpu-engine" : "1100",
	"gpu-memclock" : "1500",
	"gpu-shaders" : "2048",
	"gpu-threads" : "2",
	"gpu-vddc" : "1200",
	"gpu-powertune" : "0",
	"intensity" : "19",
	"xintensity" : "0",
	"rawintensity" : "0",
	"thread-concurrency" : "8192",
	"lookup-gap" : "2",
	"worksize" : "128"
}

platform name Advanced Micro Devices, Inc. index 0
threadconcurrency 1030
ADL Overdrive 5 Was Found!
ADL Overdrive 6 Was Found!
ADL index 0, id 65353856 - BIOS partno.: 113-AD55200-101, version: 015.032.000.001, date: 2013/03/31
 22:04
ADL_Overdrive5_FanSpeed_Get failed for default value!
GPU 0 call to fanspeed get failed!
vecgpudata size 1

                ********* Coinshield sk-1024 miner for amd GPUs by djm34 *********
                                     original design by bitslapper 2014
                                           Copyright 2014 djm34
                donation address CSD: 2S2pCpRXyb8Lpre52U3Xjq2MguSdaea5YGjVTsJqgZBfL2S24ag

Connected to 127.0.0.1:9325...
[MASTER] Coinshield Network | New Block 32636
[METERS] 0 Hashes | 0.000000 KHash/s | Height = 32636

	/** Breaks the remainder of last composite in Prime Cluster into an integer. 
		Larger numbers are more rare to find, so a proportion can be determined 
		to give decimal difficulty between whole number increases. **/
	unsigned int GetFractionalDifficulty(CBigNum composite)
	{
		/** Break the remainder of Fermat test to calculate fractional difficulty [Thanks Sunny] **/
		return ((composite - FermatTest(composite, 2) << 24) / composite).getuint();
	}

		double fractionalRemainder = 1000000.0 / GetFractionalDifficulty(next);
		if(fractionalRemainder > 1.0 || fractionalRemainder < 0.0)
			fractionalRemainder = 0.0;

	/** Determines the difficulty of the Given Prime Number.
		Difficulty is represented as so V.X
		V is the whole number, or Cluster Size, X is a proportion
		of Fermat Remainder from last Composite Number [0 - 1] **/
	double GetPrimeDifficulty(CBigNum prime, int checks)
	{
		if(!PrimeCheck(prime, checks))
			return 0.0; ///difficulty of a composite number
			
		CBigNum lastPrime = prime;
		CBigNum next = prime + 2;
		unsigned int clusterSize = 1;
		
		///largest prime gap in cluster can be + 12
		///this was determined by previously found clusters up to 17 primes
		for( next ; next <= lastPrime + 12; next += 2)
		{
			if(PrimeCheck(next, checks))
			{
				lastPrime = next;
				++clusterSize;
			}
		}
		
		///calulate the rarety of cluster from proportion of fermat remainder of last prime + 2
		///keep fractional remainder in bounds of [0, 1]
		double fractionalRemainder = 1000000.0 / GetFractionalDifficulty(next);
		if(fractionalRemainder > 1.0 || fractionalRemainder < 0.0)
			fractionalRemainder = 0.0;
		
		return (clusterSize + fractionalRemainder);
	}