Block #2,219,196

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/23/2017, 11:37:46 AM · Difficulty 10.9448 · 4,623,509 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4faf086942d171337faa5893f42bd94589bb86092ff7d4b800adc017d174224c

Height

#2,219,196

Difficulty

10.944777

Transactions

8

Size

3.15 KB

Version

2

Bits

0af1dce4

Nonce

575,253,434

Timestamp

7/23/2017, 11:37:46 AM

Confirmations

4,623,509

Merkle Root

e9932e8585f7edd8fe5c82759e4034060d8248e46967e7ed0def966ef50114a5
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.504 × 10⁹⁵(96-digit number)
15046291050830463814…93661096528282264321
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.504 × 10⁹⁵(96-digit number)
15046291050830463814…93661096528282264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.009 × 10⁹⁵(96-digit number)
30092582101660927629…87322193056564528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.018 × 10⁹⁵(96-digit number)
60185164203321855259…74644386113129057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.203 × 10⁹⁶(97-digit number)
12037032840664371051…49288772226258114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.407 × 10⁹⁶(97-digit number)
24074065681328742103…98577544452516229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.814 × 10⁹⁶(97-digit number)
48148131362657484207…97155088905032458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.629 × 10⁹⁶(97-digit number)
96296262725314968415…94310177810064916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.925 × 10⁹⁷(98-digit number)
19259252545062993683…88620355620129832961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.851 × 10⁹⁷(98-digit number)
38518505090125987366…77240711240259665921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.703 × 10⁹⁷(98-digit number)
77037010180251974732…54481422480519331841
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,985,989 XPM·at block #6,842,704 · 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