|
|
|
@ -307,9 +307,9 @@ namespace cryptonote {
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for ( i = 1; i <= N; i++) {
|
|
|
|
|
// Ignore long solvetimes if they were preceeded by 3 or 6 fast solves.
|
|
|
|
|
if ( i > 4 && TS[i]-TS[i-1] > 4*T && TS[i-1] - TS[i-4] < (16*T)/10 ) { ST = 2*T; }
|
|
|
|
|
else if ( i > 7 && TS[i]-TS[i-1] > 4*T && TS[i-1] - TS[i-7] < 4*T ) { ST = 2*T; }
|
|
|
|
|
// Temper long solvetime drops if they were preceded by 3 or 6 fast solves.
|
|
|
|
|
if ( i > 4 && TS[i]-TS[i-1] > 5*T && TS[i-1] - TS[i-4] < (14*T)/10 ) { ST = 2*T; }
|
|
|
|
|
else if ( i > 7 && TS[i]-TS[i-1] > 5*T && TS[i-1] - TS[i-7] < 4*T ) { ST = 2*T; }
|
|
|
|
|
else { // Assume normal conditions, so get ST.
|
|
|
|
|
// LWMA drops too much from long ST, so limit drops with a 5*T limit
|
|
|
|
|
ST = std::min(5*T ,TS[i] - TS[i-1]);
|
|
|
|
|