Block #476,373

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/5/2014, 7:16:26 PM · Difficulty 10.4714 · 6,337,530 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6d62dc6bdd70247364e9848c051be98eaf31a224b2fed0aa79baed4f87dc9abe

Height

#476,373

Difficulty

10.471391

Transactions

11

Size

5.48 KB

Version

2

Bits

0a78ad1b

Nonce

15,782

Timestamp

4/5/2014, 7:16:26 PM

Confirmations

6,337,530

Merkle Root

d6633d0f3dc8b74188099e1a20dd0e4b86872699535ffe907e0aef16e8a3fc52
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.940 × 10¹⁰²(103-digit number)
19405559413066062094…67889490380765625601
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.940 × 10¹⁰²(103-digit number)
19405559413066062094…67889490380765625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.881 × 10¹⁰²(103-digit number)
38811118826132124189…35778980761531251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.762 × 10¹⁰²(103-digit number)
77622237652264248379…71557961523062502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.552 × 10¹⁰³(104-digit number)
15524447530452849675…43115923046125004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.104 × 10¹⁰³(104-digit number)
31048895060905699351…86231846092250009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.209 × 10¹⁰³(104-digit number)
62097790121811398703…72463692184500019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.241 × 10¹⁰⁴(105-digit number)
12419558024362279740…44927384369000038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.483 × 10¹⁰⁴(105-digit number)
24839116048724559481…89854768738000076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.967 × 10¹⁰⁴(105-digit number)
49678232097449118962…79709537476000153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.935 × 10¹⁰⁴(105-digit number)
99356464194898237925…59419074952000307201
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,755,303 XPM·at block #6,813,902 · 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