Block #2,915,703

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/9/2018, 5:39:56 AM · Difficulty 11.4474 · 3,916,269 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab32d04ebd6b4a310826c0aa08c2475c731e2692c16f9b78c7e1c32d9ec2d419

Height

#2,915,703

Difficulty

11.447395

Transactions

2

Size

427 B

Version

2

Bits

0b728874

Nonce

1,083,417,614

Timestamp

11/9/2018, 5:39:56 AM

Confirmations

3,916,269

Merkle Root

066d0c0047e5deae97df07ce8d274724942b6c3aa478eff25f67c1a325a1dc61
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.

1.596 × 10⁹⁶(97-digit number)
15964486508781546412…83670487261920542721
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.596 × 10⁹⁶(97-digit number)
15964486508781546412…83670487261920542721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.192 × 10⁹⁶(97-digit number)
31928973017563092824…67340974523841085441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.385 × 10⁹⁶(97-digit number)
63857946035126185649…34681949047682170881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.277 × 10⁹⁷(98-digit number)
12771589207025237129…69363898095364341761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.554 × 10⁹⁷(98-digit number)
25543178414050474259…38727796190728683521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.108 × 10⁹⁷(98-digit number)
51086356828100948519…77455592381457367041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.021 × 10⁹⁸(99-digit number)
10217271365620189703…54911184762914734081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.043 × 10⁹⁸(99-digit number)
20434542731240379407…09822369525829468161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.086 × 10⁹⁸(99-digit number)
40869085462480758815…19644739051658936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.173 × 10⁹⁸(99-digit number)
81738170924961517631…39289478103317872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.634 × 10⁹⁹(100-digit number)
16347634184992303526…78578956206635745281
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,899,898 XPM·at block #6,831,971 · 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