Block #545,445

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2014, 9:41:21 AM · Difficulty 10.9532 · 6,265,491 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
04e0b7ded74b2f2abe37b61a2ebf92e265561b1650ae3bc35192b29c104c5a54

Height

#545,445

Difficulty

10.953245

Transactions

2

Size

1.14 KB

Version

2

Bits

0af407d6

Nonce

8,889

Timestamp

5/15/2014, 9:41:21 AM

Confirmations

6,265,491

Merkle Root

82a692eca2b130114fe58c2fe5c1703eddb1e47c86b3498f9b1c30a347cb47c9
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.

9.640 × 10⁹⁹(100-digit number)
96400597002530833402…76946429626277492641
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
9.640 × 10⁹⁹(100-digit number)
96400597002530833402…76946429626277492641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.928 × 10¹⁰⁰(101-digit number)
19280119400506166680…53892859252554985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.856 × 10¹⁰⁰(101-digit number)
38560238801012333361…07785718505109970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.712 × 10¹⁰⁰(101-digit number)
77120477602024666722…15571437010219941121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.542 × 10¹⁰¹(102-digit number)
15424095520404933344…31142874020439882241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.084 × 10¹⁰¹(102-digit number)
30848191040809866688…62285748040879764481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.169 × 10¹⁰¹(102-digit number)
61696382081619733377…24571496081759528961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.233 × 10¹⁰²(103-digit number)
12339276416323946675…49142992163519057921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.467 × 10¹⁰²(103-digit number)
24678552832647893351…98285984327038115841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.935 × 10¹⁰²(103-digit number)
49357105665295786702…96571968654076231681
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,731,592 XPM·at block #6,810,935 · 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