Block #403,770

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 10:00:57 AM · Difficulty 10.4320 · 6,405,814 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
047889c28ac794d759bc9ad30353880b9a73cb75c1400d365ac68dceb7db9e8f

Height

#403,770

Difficulty

10.432042

Transactions

1

Size

902 B

Version

2

Bits

0a6e9a49

Nonce

79,290

Timestamp

2/14/2014, 10:00:57 AM

Confirmations

6,405,814

Merkle Root

a31dbf6b8defda7685ef0b5bf822040743c723e185cdac70490908e424f6ee50
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.995 × 10⁹⁶(97-digit number)
19957022015752064565…55015721179982026241
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.995 × 10⁹⁶(97-digit number)
19957022015752064565…55015721179982026241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.991 × 10⁹⁶(97-digit number)
39914044031504129130…10031442359964052481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.982 × 10⁹⁶(97-digit number)
79828088063008258260…20062884719928104961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.596 × 10⁹⁷(98-digit number)
15965617612601651652…40125769439856209921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.193 × 10⁹⁷(98-digit number)
31931235225203303304…80251538879712419841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.386 × 10⁹⁷(98-digit number)
63862470450406606608…60503077759424839681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.277 × 10⁹⁸(99-digit number)
12772494090081321321…21006155518849679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.554 × 10⁹⁸(99-digit number)
25544988180162642643…42012311037699358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.108 × 10⁹⁸(99-digit number)
51089976360325285286…84024622075398717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.021 × 10⁹⁹(100-digit number)
10217995272065057057…68049244150797434881
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,750 XPM·at block #6,809,583 · 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