Block #2,177,868

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2017, 7:21:41 PM · Difficulty 10.9243 · 4,648,822 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa64475949e884bfea64d071f1642cc9ba1b77c884ba2f0c1acecc192552fc56

Height

#2,177,868

Difficulty

10.924295

Transactions

2

Size

4.46 KB

Version

2

Bits

0aec9e93

Nonce

2,040,761,522

Timestamp

6/25/2017, 7:21:41 PM

Confirmations

4,648,822

Merkle Root

e3344606386e7d3556a68330ccc936c809eadcfb88f0b3ac54950c832a4d83b3
Transactions (2)
1 in → 1 out8.4400 XPM109 B
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.441 × 10⁹⁵(96-digit number)
14416096500360516201…34044695911750050101
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.441 × 10⁹⁵(96-digit number)
14416096500360516201…34044695911750050101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.883 × 10⁹⁵(96-digit number)
28832193000721032402…68089391823500100201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.766 × 10⁹⁵(96-digit number)
57664386001442064805…36178783647000200401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.153 × 10⁹⁶(97-digit number)
11532877200288412961…72357567294000400801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.306 × 10⁹⁶(97-digit number)
23065754400576825922…44715134588000801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.613 × 10⁹⁶(97-digit number)
46131508801153651844…89430269176001603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.226 × 10⁹⁶(97-digit number)
92263017602307303689…78860538352003206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.845 × 10⁹⁷(98-digit number)
18452603520461460737…57721076704006412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.690 × 10⁹⁷(98-digit number)
36905207040922921475…15442153408012825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.381 × 10⁹⁷(98-digit number)
73810414081845842951…30884306816025651201
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,857,671 XPM·at block #6,826,689 · 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