Block #1,405,333

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/9/2016, 3:06:33 AM · Difficulty 10.8070 · 5,432,397 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0bc1989a765e9ae76831de296361e8f97394d21655e791792ec2d978c7110530

Height

#1,405,333

Difficulty

10.807015

Transactions

2

Size

1017 B

Version

2

Bits

0ace9891

Nonce

596,990,870

Timestamp

1/9/2016, 3:06:33 AM

Confirmations

5,432,397

Merkle Root

31b76649d7a52d270b2d97129ac5ee77ab6b1f39d2799819e4de167cbae69605
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.983 × 10⁹⁴(95-digit number)
39837076259145879498…09221881126732141601
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.983 × 10⁹⁴(95-digit number)
39837076259145879498…09221881126732141601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.967 × 10⁹⁴(95-digit number)
79674152518291758997…18443762253464283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.593 × 10⁹⁵(96-digit number)
15934830503658351799…36887524506928566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.186 × 10⁹⁵(96-digit number)
31869661007316703599…73775049013857132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.373 × 10⁹⁵(96-digit number)
63739322014633407198…47550098027714265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.274 × 10⁹⁶(97-digit number)
12747864402926681439…95100196055428531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.549 × 10⁹⁶(97-digit number)
25495728805853362879…90200392110857062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.099 × 10⁹⁶(97-digit number)
50991457611706725758…80400784221714124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.019 × 10⁹⁷(98-digit number)
10198291522341345151…60801568443428249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.039 × 10⁹⁷(98-digit number)
20396583044682690303…21603136886856499201
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,946,171 XPM·at block #6,837,729 · 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