Block #1,429,736

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/27/2016, 2:04:24 AM · Difficulty 10.7435 · 5,407,337 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd1b5ad652d8a4b222718f4500958f8fdc0319076e0e4cdaa29cb27f76deffb5

Height

#1,429,736

Difficulty

10.743508

Transactions

2

Size

722 B

Version

2

Bits

0abe5686

Nonce

1,053,139,877

Timestamp

1/27/2016, 2:04:24 AM

Confirmations

5,407,337

Merkle Root

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

1.611 × 10⁹⁴(95-digit number)
16112857993404887070…04899890431680919721
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.611 × 10⁹⁴(95-digit number)
16112857993404887070…04899890431680919721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.222 × 10⁹⁴(95-digit number)
32225715986809774141…09799780863361839441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.445 × 10⁹⁴(95-digit number)
64451431973619548282…19599561726723678881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.289 × 10⁹⁵(96-digit number)
12890286394723909656…39199123453447357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.578 × 10⁹⁵(96-digit number)
25780572789447819312…78398246906894715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.156 × 10⁹⁵(96-digit number)
51561145578895638625…56796493813789431041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.031 × 10⁹⁶(97-digit number)
10312229115779127725…13592987627578862081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.062 × 10⁹⁶(97-digit number)
20624458231558255450…27185975255157724161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.124 × 10⁹⁶(97-digit number)
41248916463116510900…54371950510315448321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.249 × 10⁹⁶(97-digit number)
82497832926233021800…08743901020630896641
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,940,889 XPM·at block #6,837,072 · 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