Block #2,647,366

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 9:33:20 PM · Difficulty 11.7584 · 4,184,512 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
29fb26d283a28232fc37761a1ffba630157dec1c25cac050b0cf52ab6f1c882e

Height

#2,647,366

Difficulty

11.758382

Transactions

2

Size

1.14 KB

Version

2

Bits

0bc2254f

Nonce

2,003,760,575

Timestamp

5/3/2018, 9:33:20 PM

Confirmations

4,184,512

Merkle Root

eb6846da1d72fc034a608137c1852d19e3dc4d9a36edd38f675e722b82edc2ec
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.

3.312 × 10⁹⁴(95-digit number)
33125590029268166123…23931174397750420361
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
3.312 × 10⁹⁴(95-digit number)
33125590029268166123…23931174397750420361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.625 × 10⁹⁴(95-digit number)
66251180058536332246…47862348795500840721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.325 × 10⁹⁵(96-digit number)
13250236011707266449…95724697591001681441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.650 × 10⁹⁵(96-digit number)
26500472023414532898…91449395182003362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.300 × 10⁹⁵(96-digit number)
53000944046829065796…82898790364006725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.060 × 10⁹⁶(97-digit number)
10600188809365813159…65797580728013451521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.120 × 10⁹⁶(97-digit number)
21200377618731626318…31595161456026903041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.240 × 10⁹⁶(97-digit number)
42400755237463252637…63190322912053806081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.480 × 10⁹⁶(97-digit number)
84801510474926505274…26380645824107612161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.696 × 10⁹⁷(98-digit number)
16960302094985301054…52761291648215224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.392 × 10⁹⁷(98-digit number)
33920604189970602109…05522583296430448641
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,899,145 XPM·at block #6,831,877 · 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