Block #475,356

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/5/2014, 4:36:10 AM · Difficulty 10.4562 · 6,349,459 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
461eb127de1cfb3c2d5285e34b802a81728a4700a68e20c42374c9aa5eeba786

Height

#475,356

Difficulty

10.456190

Transactions

6

Size

1.29 KB

Version

2

Bits

0a74c8df

Nonce

1,251,760

Timestamp

4/5/2014, 4:36:10 AM

Confirmations

6,349,459

Merkle Root

bfac88810d15854697ab0ffc02f4a0815b19767c6016d50d7f2adc60416d1c26
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.640 × 10⁹⁷(98-digit number)
16409494881059761138…52536567464011101521
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.640 × 10⁹⁷(98-digit number)
16409494881059761138…52536567464011101521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.281 × 10⁹⁷(98-digit number)
32818989762119522276…05073134928022203041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.563 × 10⁹⁷(98-digit number)
65637979524239044552…10146269856044406081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.312 × 10⁹⁸(99-digit number)
13127595904847808910…20292539712088812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.625 × 10⁹⁸(99-digit number)
26255191809695617821…40585079424177624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.251 × 10⁹⁸(99-digit number)
52510383619391235642…81170158848355248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.050 × 10⁹⁹(100-digit number)
10502076723878247128…62340317696710497281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.100 × 10⁹⁹(100-digit number)
21004153447756494256…24680635393420994561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.200 × 10⁹⁹(100-digit number)
42008306895512988513…49361270786841989121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.401 × 10⁹⁹(100-digit number)
84016613791025977027…98722541573683978241
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,842,597 XPM·at block #6,824,814 · 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