Block #1,532,688

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2016, 1:25:24 AM · Difficulty 10.6143 · 5,309,329 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
34d6b59a16c895ad36fcbfb19d987789ad7d09f561d43ee2de6652f72f811afd

Height

#1,532,688

Difficulty

10.614287

Transactions

2

Size

9.80 KB

Version

2

Bits

0a9d41ee

Nonce

587,618,532

Timestamp

4/9/2016, 1:25:24 AM

Confirmations

5,309,329

Merkle Root

78edc0d81936574ec8347711af2191b7286790cb32c4001cf51c6be2a57c7615
Transactions (2)
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.

3.070 × 10⁹⁴(95-digit number)
30705148205106852989…34824899611570786001
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
3.070 × 10⁹⁴(95-digit number)
30705148205106852989…34824899611570786001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.141 × 10⁹⁴(95-digit number)
61410296410213705979…69649799223141572001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.228 × 10⁹⁵(96-digit number)
12282059282042741195…39299598446283144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.456 × 10⁹⁵(96-digit number)
24564118564085482391…78599196892566288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.912 × 10⁹⁵(96-digit number)
49128237128170964783…57198393785132576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.825 × 10⁹⁵(96-digit number)
98256474256341929567…14396787570265152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.965 × 10⁹⁶(97-digit number)
19651294851268385913…28793575140530304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.930 × 10⁹⁶(97-digit number)
39302589702536771826…57587150281060608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.860 × 10⁹⁶(97-digit number)
78605179405073543653…15174300562121216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.572 × 10⁹⁷(98-digit number)
15721035881014708730…30348601124242432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.144 × 10⁹⁷(98-digit number)
31442071762029417461…60697202248484864001
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,980,523 XPM·at block #6,842,016 · 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