Block #2,220,256

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2017, 4:37:55 AM · Difficulty 10.9452 · 4,622,150 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
54eef81af5649359bf99d03c662c19dba29c834bdb8ba3f8c019f78142513de8

Height

#2,220,256

Difficulty

10.945226

Transactions

2

Size

687 B

Version

2

Bits

0af1fa56

Nonce

612,749,482

Timestamp

7/24/2017, 4:37:55 AM

Confirmations

4,622,150

Merkle Root

f3bba3804fb9f0acc739ae89e4b018eeac19186d4000a51c572ee44594f222d2
Transactions (2)
1 in → 1 out8.3400 XPM110 B
3 in → 1 out307.9900 XPM488 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.

7.020 × 10⁹¹(92-digit number)
70202609558621175839…80748048502537420961
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
7.020 × 10⁹¹(92-digit number)
70202609558621175839…80748048502537420961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.404 × 10⁹²(93-digit number)
14040521911724235167…61496097005074841921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.808 × 10⁹²(93-digit number)
28081043823448470335…22992194010149683841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.616 × 10⁹²(93-digit number)
56162087646896940671…45984388020299367681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.123 × 10⁹³(94-digit number)
11232417529379388134…91968776040598735361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.246 × 10⁹³(94-digit number)
22464835058758776268…83937552081197470721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.492 × 10⁹³(94-digit number)
44929670117517552537…67875104162394941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.985 × 10⁹³(94-digit number)
89859340235035105074…35750208324789882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.797 × 10⁹⁴(95-digit number)
17971868047007021014…71500416649579765761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.594 × 10⁹⁴(95-digit number)
35943736094014042029…43000833299159531521
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,983,660 XPM·at block #6,842,405 · 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