Block #451,698

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 3:30:17 AM · Difficulty 10.3784 · 6,364,689 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
595976e5752e0ff21d3ac572823f3f1fc8403e9c79a98801f26c3918401a2ac6

Height

#451,698

Difficulty

10.378357

Transactions

1

Size

1004 B

Version

2

Bits

0a60dc01

Nonce

8,810

Timestamp

3/20/2014, 3:30:17 AM

Confirmations

6,364,689

Merkle Root

f8c50e43cc5fe5a869a75765196ebb7a96ebf43cba7653019c0020a25979932c
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.723 × 10⁹⁶(97-digit number)
17234844958791990809…19054537191472974721
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.723 × 10⁹⁶(97-digit number)
17234844958791990809…19054537191472974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.446 × 10⁹⁶(97-digit number)
34469689917583981619…38109074382945949441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.893 × 10⁹⁶(97-digit number)
68939379835167963239…76218148765891898881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.378 × 10⁹⁷(98-digit number)
13787875967033592647…52436297531783797761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.757 × 10⁹⁷(98-digit number)
27575751934067185295…04872595063567595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.515 × 10⁹⁷(98-digit number)
55151503868134370591…09745190127135191041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.103 × 10⁹⁸(99-digit number)
11030300773626874118…19490380254270382081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.206 × 10⁹⁸(99-digit number)
22060601547253748236…38980760508540764161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.412 × 10⁹⁸(99-digit number)
44121203094507496473…77961521017081528321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.824 × 10⁹⁸(99-digit number)
88242406189014992946…55923042034163056641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.764 × 10⁹⁹(100-digit number)
17648481237802998589…11846084068326113281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,775,218 XPM·at block #6,816,386 · 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