Block #2,213,774

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/19/2017, 6:29:38 PM · Difficulty 10.9438 · 4,628,011 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c5f237bc6ce9bb63e57064f1cf1f73c39f8c07ecfac88ab52504811077829ad

Height

#2,213,774

Difficulty

10.943806

Transactions

21

Size

6.78 KB

Version

2

Bits

0af19d4c

Nonce

114,816,473

Timestamp

7/19/2017, 6:29:38 PM

Confirmations

4,628,011

Merkle Root

6887dda6c490c355b725e66c6509d25219412d7fa1033ebdfa42ba775ef1ea14
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.

6.486 × 10⁹³(94-digit number)
64869813619608297527…70680528132696574961
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
6.486 × 10⁹³(94-digit number)
64869813619608297527…70680528132696574961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.297 × 10⁹⁴(95-digit number)
12973962723921659505…41361056265393149921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.594 × 10⁹⁴(95-digit number)
25947925447843319010…82722112530786299841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.189 × 10⁹⁴(95-digit number)
51895850895686638021…65444225061572599681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.037 × 10⁹⁵(96-digit number)
10379170179137327604…30888450123145199361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.075 × 10⁹⁵(96-digit number)
20758340358274655208…61776900246290398721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.151 × 10⁹⁵(96-digit number)
41516680716549310417…23553800492580797441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.303 × 10⁹⁵(96-digit number)
83033361433098620834…47107600985161594881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.660 × 10⁹⁶(97-digit number)
16606672286619724166…94215201970323189761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.321 × 10⁹⁶(97-digit number)
33213344573239448333…88430403940646379521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.642 × 10⁹⁶(97-digit number)
66426689146478896667…76860807881292759041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,978,658 XPM·at block #6,841,784 · 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