Block #2,213,321

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/19/2017, 10:33:56 AM · Difficulty 10.9440 · 4,613,603 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7df46c4419e8ff41620a0005a582150d52743e4c136b0e331b87117b1a52b3db

Height

#2,213,321

Difficulty

10.944031

Transactions

2

Size

425 B

Version

2

Bits

0af1ac06

Nonce

351,212,051

Timestamp

7/19/2017, 10:33:56 AM

Confirmations

4,613,603

Merkle Root

99552a6706255c0c37656656fb66c4e16525c7ed5667dd4a2f2cafae32ca953b
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.

5.585 × 10⁹⁵(96-digit number)
55857496376879804068…02646460830234510081
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
5.585 × 10⁹⁵(96-digit number)
55857496376879804068…02646460830234510081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.117 × 10⁹⁶(97-digit number)
11171499275375960813…05292921660469020161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.234 × 10⁹⁶(97-digit number)
22342998550751921627…10585843320938040321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.468 × 10⁹⁶(97-digit number)
44685997101503843254…21171686641876080641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.937 × 10⁹⁶(97-digit number)
89371994203007686509…42343373283752161281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.787 × 10⁹⁷(98-digit number)
17874398840601537301…84686746567504322561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.574 × 10⁹⁷(98-digit number)
35748797681203074603…69373493135008645121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.149 × 10⁹⁷(98-digit number)
71497595362406149207…38746986270017290241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.429 × 10⁹⁸(99-digit number)
14299519072481229841…77493972540034580481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.859 × 10⁹⁸(99-digit number)
28599038144962459682…54987945080069160961
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,859,563 XPM·at block #6,826,923 · 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