An independent guide
This guide discusses the name 55GG and provides its own original browser demonstration, Consecutive GCD Interaction Claim. The demonstration does not establish an affiliation with an outside business or reproduce an outside product.
Twelve bits and common divisors
Twelve independent fair binary steps reveal three blocks of four bits. Decode each completed block as 0–15 and add 1 to obtain a, b and c, each 1–16. Compute gcd(a+b,b+c) × gcd(b+c,c+a), where gcd is the greatest common divisor. Subtract the global minimum 1 to obtain the score. Before starting, choose the linear, squared or cubed score weight.
A quote that can fall
The gross multiplier starts at 0.97. At each step it equals 0.97 × conditional expected terminal weight / initial expected terminal weight, using the selected curve and the revealed bits. It can rise, fall or become zero. This is not a multiplier that always climbs. The displayed multiplier is rounded to four decimal places; settlement uses the unrounded value. Stake × multiplier is gross return, not net profit.
Settings and the main button
Choose a virtual stake of 10, 20, 50 or 100, a reward curve and automatic collection off or at 1.25×, 1.75× or 2.50×. Starting deducts and saves one stake. During the round, stake, settings, restoration and another start are locked; sound remains available. The main button becomes Collect current quote, allowing manual collection while the round remains active. Manual collection first processes any steps already due before settling the current quote.
Automatic collection and zero
Automatic collection triggers at the first step whose quote reaches or exceeds the selected threshold. It pays the actual current quote, including any overshoot, rather than exactly the preset threshold. At any one step, zero ends the round before collection. An automatic crossing at an earlier step settles the round before a later zero could occur. At step 12, any surviving positive quote is collected even if the automatic threshold was never reached.
Example: a=b=c=1
If a=b=c=1, the raw statistic is gcd(2,2) × gcd(2,2) = 4 and the score is 4 − 1 = 3. The linear, squared and cubed terminal weights are 3, 9 and 27. These are weights, not multipliers. For the linear curve and this all-zero bit path, gross quotes are 0.97 at step 0, approximately 0.7489 at step 1, 0.5190 at step 6 and 0.3389 at step 12. This example demonstrates a falling quote, not a predicted session outcome.
Frequently asked questions
What is the score?
The score is gcd(a+b,b+c) × gcd(b+c,c+a) − 1. The greatest common divisor is the largest positive integer dividing both inputs. For a=b=c=1 the score is 3.
Can a later zero undo automatic collection?
No. An earlier threshold crossing settles the round before a later step. Zero takes precedence over collection only at the same processing event.
Does automatic collection pay exactly its threshold?
No. It collects the actual current quote at the first reaching or crossing step, including overshoot. Step 12 collects a surviving positive quote even below the threshold.
