Block #472,054

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/3/2014, 12:42:17 AM · Difficulty 10.4337 · 6,341,962 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
de2d65bf4e067370fd6c6984e2dd4d68471f7cff14429812ca659cd50b655207

Height

#472,054

Difficulty

10.433661

Transactions

3

Size

5.26 KB

Version

2

Bits

0a6f046e

Nonce

19,037,956

Timestamp

4/3/2014, 12:42:17 AM

Confirmations

6,341,962

Merkle Root

e39c55ae70e51d4985a35a5cb942a07c384657886350ead71cd124a447ae7e42
Transactions (3)
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.247 × 10⁹⁵(96-digit number)
22474395076799483554…53000043932510370241
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.247 × 10⁹⁵(96-digit number)
22474395076799483554…53000043932510370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.494 × 10⁹⁵(96-digit number)
44948790153598967108…06000087865020740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.989 × 10⁹⁵(96-digit number)
89897580307197934217…12000175730041480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.797 × 10⁹⁶(97-digit number)
17979516061439586843…24000351460082961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.595 × 10⁹⁶(97-digit number)
35959032122879173686…48000702920165923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.191 × 10⁹⁶(97-digit number)
71918064245758347373…96001405840331847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.438 × 10⁹⁷(98-digit number)
14383612849151669474…92002811680663695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.876 × 10⁹⁷(98-digit number)
28767225698303338949…84005623361327390721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.753 × 10⁹⁷(98-digit number)
57534451396606677898…68011246722654781441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.150 × 10⁹⁸(99-digit number)
11506890279321335579…36022493445309562881
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,756,212 XPM·at block #6,814,015 · 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