Block #2,471,123

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2018, 1:25:52 PM · Difficulty 10.9617 · 4,368,264 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
704786d6e7e47802047d16353e1af6c2ef8d70bf35f37418893650873a3f702b

Height

#2,471,123

Difficulty

10.961664

Transactions

2

Size

721 B

Version

2

Bits

0af62fa0

Nonce

317,308,762

Timestamp

1/13/2018, 1:25:52 PM

Confirmations

4,368,264

Merkle Root

a531a67b122d5d5edea54a386ebe7fbb4b3527e075911bd600b832cfd261b4f8
Transactions (2)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

3.107 × 10⁹⁵(96-digit number)
31070036515907191256…57637578712147189441
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
3.107 × 10⁹⁵(96-digit number)
31070036515907191256…57637578712147189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.214 × 10⁹⁵(96-digit number)
62140073031814382512…15275157424294378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.242 × 10⁹⁶(97-digit number)
12428014606362876502…30550314848588757761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.485 × 10⁹⁶(97-digit number)
24856029212725753004…61100629697177515521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.971 × 10⁹⁶(97-digit number)
49712058425451506009…22201259394355031041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.942 × 10⁹⁶(97-digit number)
99424116850903012019…44402518788710062081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.988 × 10⁹⁷(98-digit number)
19884823370180602403…88805037577420124161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.976 × 10⁹⁷(98-digit number)
39769646740361204807…77610075154840248321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.953 × 10⁹⁷(98-digit number)
79539293480722409615…55220150309680496641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.590 × 10⁹⁸(99-digit number)
15907858696144481923…10440300619360993281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,959,380 XPM·at block #6,839,386 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy