Block #2,164,909

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/17/2017, 8:03:39 PM · Difficulty 10.8980 · 4,676,892 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d42c56ab1f2ba028a0457a2aea57ce4e3d63238026a7cc9442077a9e68b29d7a

Height

#2,164,909

Difficulty

10.898001

Transactions

2

Size

869 B

Version

2

Bits

0ae5e361

Nonce

411,995,974

Timestamp

6/17/2017, 8:03:39 PM

Confirmations

4,676,892

Merkle Root

328f043d2ac50c754786c21cd8c497f101b5ddec98b35488e4d9e434f06f7e39
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.

2.696 × 10⁹⁵(96-digit number)
26965166376127112493…39466786123266916801
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
2.696 × 10⁹⁵(96-digit number)
26965166376127112493…39466786123266916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.393 × 10⁹⁵(96-digit number)
53930332752254224986…78933572246533833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.078 × 10⁹⁶(97-digit number)
10786066550450844997…57867144493067667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.157 × 10⁹⁶(97-digit number)
21572133100901689994…15734288986135334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.314 × 10⁹⁶(97-digit number)
43144266201803379989…31468577972270668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.628 × 10⁹⁶(97-digit number)
86288532403606759978…62937155944541337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.725 × 10⁹⁷(98-digit number)
17257706480721351995…25874311889082675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.451 × 10⁹⁷(98-digit number)
34515412961442703991…51748623778165350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.903 × 10⁹⁷(98-digit number)
69030825922885407982…03497247556330700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.380 × 10⁹⁸(99-digit number)
13806165184577081596…06994495112661401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.761 × 10⁹⁸(99-digit number)
27612330369154163193…13988990225322803201
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,787 XPM·at block #6,841,800 · 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