Block #403,375

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 3:37:51 AM · Difficulty 10.4288 · 6,406,161 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b525e88cfbca164a24482b0777403fc8dd4c98a332268fc93c10b9ba4003131c

Height

#403,375

Difficulty

10.428770

Transactions

8

Size

2.45 KB

Version

2

Bits

0a6dc3dd

Nonce

38,122,245

Timestamp

2/14/2014, 3:37:51 AM

Confirmations

6,406,161

Merkle Root

92a843ba4a80c712977ba3e324d3a0d831b120e32cf5af8a2568df66d8e14511
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.

2.946 × 10⁹⁶(97-digit number)
29466776059723419224…54490641707941232641
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
2.946 × 10⁹⁶(97-digit number)
29466776059723419224…54490641707941232641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.893 × 10⁹⁶(97-digit number)
58933552119446838448…08981283415882465281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.178 × 10⁹⁷(98-digit number)
11786710423889367689…17962566831764930561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.357 × 10⁹⁷(98-digit number)
23573420847778735379…35925133663529861121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.714 × 10⁹⁷(98-digit number)
47146841695557470758…71850267327059722241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.429 × 10⁹⁷(98-digit number)
94293683391114941517…43700534654119444481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.885 × 10⁹⁸(99-digit number)
18858736678222988303…87401069308238888961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.771 × 10⁹⁸(99-digit number)
37717473356445976606…74802138616477777921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.543 × 10⁹⁸(99-digit number)
75434946712891953213…49604277232955555841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.508 × 10⁹⁹(100-digit number)
15086989342578390642…99208554465911111681
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,720,367 XPM·at block #6,809,535 · 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