Block #912,399

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/27/2015, 9:14:52 PM · Difficulty 10.9291 · 5,896,726 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
873da42729611ea8764f082832069b6ddb091a685352420d902f6ca43366e4ef

Height

#912,399

Difficulty

10.929096

Transactions

14

Size

6.25 KB

Version

2

Bits

0aedd938

Nonce

636,772,763

Timestamp

1/27/2015, 9:14:52 PM

Confirmations

5,896,726

Merkle Root

bcad1c1de70ca2ca60d3a1403bd1978e1a8686456c04e5848dc8ed7ba123f476
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.162 × 10⁹⁷(98-digit number)
11620143818171936584…75895242759197769601
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.162 × 10⁹⁷(98-digit number)
11620143818171936584…75895242759197769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.324 × 10⁹⁷(98-digit number)
23240287636343873168…51790485518395539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.648 × 10⁹⁷(98-digit number)
46480575272687746336…03580971036791078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.296 × 10⁹⁷(98-digit number)
92961150545375492673…07161942073582156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.859 × 10⁹⁸(99-digit number)
18592230109075098534…14323884147164313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.718 × 10⁹⁸(99-digit number)
37184460218150197069…28647768294328627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.436 × 10⁹⁸(99-digit number)
74368920436300394138…57295536588657254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.487 × 10⁹⁹(100-digit number)
14873784087260078827…14591073177314508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.974 × 10⁹⁹(100-digit number)
29747568174520157655…29182146354629017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.949 × 10⁹⁹(100-digit number)
59495136349040315311…58364292709258035201
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,717,058 XPM·at block #6,809,124 · 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.

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