Block #2,265,218

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/24/2017, 1:41:17 AM · Difficulty 10.9517 · 4,575,888 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b1574f9fcbebb62feca3a8e923b6bd1fa3a0a2d629be36ce70dd90415dd4c44

Height

#2,265,218

Difficulty

10.951710

Transactions

6

Size

3.22 KB

Version

2

Bits

0af3a33e

Nonce

308,701,961

Timestamp

8/24/2017, 1:41:17 AM

Confirmations

4,575,888

Merkle Root

1f81d8f3dcf9b10d4f926859194bf5a230c2a9768e77010f713e528b114d421a
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.452 × 10⁹⁶(97-digit number)
14525308940246776937…91474817452037222401
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.452 × 10⁹⁶(97-digit number)
14525308940246776937…91474817452037222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.905 × 10⁹⁶(97-digit number)
29050617880493553874…82949634904074444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.810 × 10⁹⁶(97-digit number)
58101235760987107748…65899269808148889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.162 × 10⁹⁷(98-digit number)
11620247152197421549…31798539616297779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.324 × 10⁹⁷(98-digit number)
23240494304394843099…63597079232595558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.648 × 10⁹⁷(98-digit number)
46480988608789686198…27194158465191116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.296 × 10⁹⁷(98-digit number)
92961977217579372397…54388316930382233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.859 × 10⁹⁸(99-digit number)
18592395443515874479…08776633860764467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.718 × 10⁹⁸(99-digit number)
37184790887031748958…17553267721528934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.436 × 10⁹⁸(99-digit number)
74369581774063497917…35106535443057868801
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,973,213 XPM·at block #6,841,105 · 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