Block #2,129,402

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2017, 4:27:27 PM · Difficulty 10.9104 · 4,709,872 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0be1d4f7c591bcdd7b2c540c4c59ed2ea2132eea26a0c2933b052dd7a246f3b6

Height

#2,129,402

Difficulty

10.910426

Transactions

9

Size

2.69 KB

Version

2

Bits

0ae911b3

Nonce

1,309,761,734

Timestamp

5/23/2017, 4:27:27 PM

Confirmations

4,709,872

Merkle Root

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

4.152 × 10⁹³(94-digit number)
41522374280557801767…58473227421818280811
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
4.152 × 10⁹³(94-digit number)
41522374280557801767…58473227421818280811
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.304 × 10⁹³(94-digit number)
83044748561115603535…16946454843636561621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.660 × 10⁹⁴(95-digit number)
16608949712223120707…33892909687273123241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.321 × 10⁹⁴(95-digit number)
33217899424446241414…67785819374546246481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.643 × 10⁹⁴(95-digit number)
66435798848892482828…35571638749092492961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.328 × 10⁹⁵(96-digit number)
13287159769778496565…71143277498184985921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.657 × 10⁹⁵(96-digit number)
26574319539556993131…42286554996369971841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.314 × 10⁹⁵(96-digit number)
53148639079113986262…84573109992739943681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.062 × 10⁹⁶(97-digit number)
10629727815822797252…69146219985479887361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.125 × 10⁹⁶(97-digit number)
21259455631645594504…38292439970959774721
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,958,477 XPM·at block #6,839,273 · 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