Block #2,995,970

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2019, 12:16:13 AM · Difficulty 11.2614 · 3,840,580 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dec29359d1ff885661cf1c0c3506b22f44fafb242676cd57ba6fc2eb731696ad

Height

#2,995,970

Difficulty

11.261354

Transactions

37

Size

9.37 KB

Version

2

Bits

0b42e814

Nonce

924,593,843

Timestamp

1/5/2019, 12:16:13 AM

Confirmations

3,840,580

Merkle Root

aed545e467694f03d6a2cf03371d18d4f15806d692a4835daed2589ed93a711d
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.353 × 10⁹⁷(98-digit number)
13534379549140362860…50053335592117739521
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.353 × 10⁹⁷(98-digit number)
13534379549140362860…50053335592117739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.706 × 10⁹⁷(98-digit number)
27068759098280725721…00106671184235479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.413 × 10⁹⁷(98-digit number)
54137518196561451442…00213342368470958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.082 × 10⁹⁸(99-digit number)
10827503639312290288…00426684736941916161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.165 × 10⁹⁸(99-digit number)
21655007278624580577…00853369473883832321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.331 × 10⁹⁸(99-digit number)
43310014557249161154…01706738947767664641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.662 × 10⁹⁸(99-digit number)
86620029114498322308…03413477895535329281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.732 × 10⁹⁹(100-digit number)
17324005822899664461…06826955791070658561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.464 × 10⁹⁹(100-digit number)
34648011645799328923…13653911582141317121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.929 × 10⁹⁹(100-digit number)
69296023291598657846…27307823164282634241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.385 × 10¹⁰⁰(101-digit number)
13859204658319731569…54615646328565268481
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,936,664 XPM·at block #6,836,549 · 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