Block #428,006

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 6:36:40 PM · Difficulty 10.3491 · 6,389,434 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d6bb610efad5d2aafb3eedd46a9aa87803efb7dcc1e146306d4f3bd177704245

Height

#428,006

Difficulty

10.349054

Transactions

3

Size

792 B

Version

2

Bits

0a595b98

Nonce

25,191

Timestamp

3/3/2014, 6:36:40 PM

Confirmations

6,389,434

Merkle Root

e9f7cd2dfe49caf6ea096e196056f582189c94131a9a6e4d7c3e07343b7b0bcd
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.183 × 10¹⁰⁴(105-digit number)
11831274021021119292…53249239747482320201
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.183 × 10¹⁰⁴(105-digit number)
11831274021021119292…53249239747482320201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.366 × 10¹⁰⁴(105-digit number)
23662548042042238584…06498479494964640401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.732 × 10¹⁰⁴(105-digit number)
47325096084084477169…12996958989929280801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.465 × 10¹⁰⁴(105-digit number)
94650192168168954339…25993917979858561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.893 × 10¹⁰⁵(106-digit number)
18930038433633790867…51987835959717123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.786 × 10¹⁰⁵(106-digit number)
37860076867267581735…03975671919434246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.572 × 10¹⁰⁵(106-digit number)
75720153734535163471…07951343838868492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.514 × 10¹⁰⁶(107-digit number)
15144030746907032694…15902687677736985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.028 × 10¹⁰⁶(107-digit number)
30288061493814065388…31805375355473971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.057 × 10¹⁰⁶(107-digit number)
60576122987628130777…63610750710947942401
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,783,567 XPM·at block #6,817,439 · 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