Block #1,537,517

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/12/2016, 6:04:16 AM · Difficulty 10.6318 · 5,287,773 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0abf395b5413c30203774c46e08660ab7b2b107bb8eedeec3393536a95dce0d6

Height

#1,537,517

Difficulty

10.631808

Transactions

2

Size

1.08 KB

Version

2

Bits

0aa1be2c

Nonce

781,685,894

Timestamp

4/12/2016, 6:04:16 AM

Confirmations

5,287,773

Merkle Root

a502fac4399eb8e8cc0433bbabe52b17ce1164c35884832e07382f437527ae8f
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.524 × 10⁹⁶(97-digit number)
25245923428804625066…13383521825558348801
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.524 × 10⁹⁶(97-digit number)
25245923428804625066…13383521825558348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.049 × 10⁹⁶(97-digit number)
50491846857609250132…26767043651116697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.009 × 10⁹⁷(98-digit number)
10098369371521850026…53534087302233395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.019 × 10⁹⁷(98-digit number)
20196738743043700053…07068174604466790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.039 × 10⁹⁷(98-digit number)
40393477486087400106…14136349208933580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.078 × 10⁹⁷(98-digit number)
80786954972174800212…28272698417867161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.615 × 10⁹⁸(99-digit number)
16157390994434960042…56545396835734323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.231 × 10⁹⁸(99-digit number)
32314781988869920084…13090793671468646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.462 × 10⁹⁸(99-digit number)
64629563977739840169…26181587342937292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.292 × 10⁹⁹(100-digit number)
12925912795547968033…52363174685874585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.585 × 10⁹⁹(100-digit number)
25851825591095936067…04726349371749171201
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,846,420 XPM·at block #6,825,289 · 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