Block #2,200,545

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/10/2017, 1:36:05 AM · Difficulty 10.9512 · 4,642,554 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f41f34255c32bfddecae0ea486162c0fbc9cce456c935d8adfe7121fd46b1cb5

Height

#2,200,545

Difficulty

10.951182

Transactions

3

Size

652 B

Version

2

Bits

0af380b2

Nonce

31,486,147

Timestamp

7/10/2017, 1:36:05 AM

Confirmations

4,642,554

Merkle Root

31c4e01c9cf56f2bbb0e7787878bc0001c01481156637b3cabb75b80b2bb3f0e
Transactions (3)
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.

1.720 × 10⁹⁴(95-digit number)
17204225453829608567…91621725110845116161
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
1.720 × 10⁹⁴(95-digit number)
17204225453829608567…91621725110845116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.440 × 10⁹⁴(95-digit number)
34408450907659217134…83243450221690232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.881 × 10⁹⁴(95-digit number)
68816901815318434269…66486900443380464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.376 × 10⁹⁵(96-digit number)
13763380363063686853…32973800886760929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.752 × 10⁹⁵(96-digit number)
27526760726127373707…65947601773521858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.505 × 10⁹⁵(96-digit number)
55053521452254747415…31895203547043717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.101 × 10⁹⁶(97-digit number)
11010704290450949483…63790407094087434241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.202 × 10⁹⁶(97-digit number)
22021408580901898966…27580814188174868481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.404 × 10⁹⁶(97-digit number)
44042817161803797932…55161628376349736961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.808 × 10⁹⁶(97-digit number)
88085634323607595865…10323256752699473921
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,989,155 XPM·at block #6,843,098 · 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