Block #2,915,907

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/9/2018, 9:30:49 AM · Difficulty 11.4446 · 3,927,704 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b9cee78dde12b7dea69f84b4e36659a3320fde05fd44daafc0d693aec0f0358

Height

#2,915,907

Difficulty

11.444628

Transactions

5

Size

1.49 KB

Version

2

Bits

0b71d324

Nonce

939,725,172

Timestamp

11/9/2018, 9:30:49 AM

Confirmations

3,927,704

Merkle Root

41d8b9e6d7fe29cb13d3f7e4f241fb8b61db6f97df49c50a95039d112f0e65a8
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.447 × 10⁹⁵(96-digit number)
24479327833560106050…10317589139319621441
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.447 × 10⁹⁵(96-digit number)
24479327833560106050…10317589139319621441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.895 × 10⁹⁵(96-digit number)
48958655667120212101…20635178278639242881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.791 × 10⁹⁵(96-digit number)
97917311334240424203…41270356557278485761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.958 × 10⁹⁶(97-digit number)
19583462266848084840…82540713114556971521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.916 × 10⁹⁶(97-digit number)
39166924533696169681…65081426229113943041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.833 × 10⁹⁶(97-digit number)
78333849067392339363…30162852458227886081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.566 × 10⁹⁷(98-digit number)
15666769813478467872…60325704916455772161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.133 × 10⁹⁷(98-digit number)
31333539626956935745…20651409832911544321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.266 × 10⁹⁷(98-digit number)
62667079253913871490…41302819665823088641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.253 × 10⁹⁸(99-digit number)
12533415850782774298…82605639331646177281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.506 × 10⁹⁸(99-digit number)
25066831701565548596…65211278663292354561
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,993,252 XPM·at block #6,843,610 · 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