Block #447,379

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 6:20:16 AM · Difficulty 10.3543 · 6,363,076 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b5516482cdddc261db1cb4a0d46f1443722f14d5658059ced45fa637d42bbf75

Height

#447,379

Difficulty

10.354321

Transactions

1

Size

902 B

Version

2

Bits

0a5ab4cd

Nonce

23,640

Timestamp

3/17/2014, 6:20:16 AM

Confirmations

6,363,076

Merkle Root

483f926df3c6cbe1960d77f07e79b5865682fbdef124af44536a86b24ee60275
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.221 × 10⁹⁸(99-digit number)
12211767895675009774…10059940907137450081
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.221 × 10⁹⁸(99-digit number)
12211767895675009774…10059940907137450081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.442 × 10⁹⁸(99-digit number)
24423535791350019548…20119881814274900161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.884 × 10⁹⁸(99-digit number)
48847071582700039096…40239763628549800321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.769 × 10⁹⁸(99-digit number)
97694143165400078192…80479527257099600641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.953 × 10⁹⁹(100-digit number)
19538828633080015638…60959054514199201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.907 × 10⁹⁹(100-digit number)
39077657266160031277…21918109028398402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.815 × 10⁹⁹(100-digit number)
78155314532320062554…43836218056796805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.563 × 10¹⁰⁰(101-digit number)
15631062906464012510…87672436113593610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.126 × 10¹⁰⁰(101-digit number)
31262125812928025021…75344872227187220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.252 × 10¹⁰⁰(101-digit number)
62524251625856050043…50689744454374440961
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,727,726 XPM·at block #6,810,454 · 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