Block #2,747,406

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/13/2018, 4:52:33 PM · Difficulty 11.6500 · 4,091,713 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fdfaac05f7abd9f2e1e266c12d2b076bf6e08c4744ee1a5b2b2a4e533bc3d406

Height

#2,747,406

Difficulty

11.649980

Transactions

42

Size

12.86 KB

Version

2

Bits

0ba6650f

Nonce

148,187,199

Timestamp

7/13/2018, 4:52:33 PM

Confirmations

4,091,713

Merkle Root

b3b97908140081e435d83355fd17e7b04d564d860a9ac5654a94da32e02c9095
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.810 × 10⁹⁷(98-digit number)
18105961096626263263…78818530108344550401
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.810 × 10⁹⁷(98-digit number)
18105961096626263263…78818530108344550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.621 × 10⁹⁷(98-digit number)
36211922193252526526…57637060216689100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.242 × 10⁹⁷(98-digit number)
72423844386505053053…15274120433378201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.448 × 10⁹⁸(99-digit number)
14484768877301010610…30548240866756403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.896 × 10⁹⁸(99-digit number)
28969537754602021221…61096481733512806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.793 × 10⁹⁸(99-digit number)
57939075509204042442…22192963467025612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.158 × 10⁹⁹(100-digit number)
11587815101840808488…44385926934051225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.317 × 10⁹⁹(100-digit number)
23175630203681616977…88771853868102451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.635 × 10⁹⁹(100-digit number)
46351260407363233954…77543707736204902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.270 × 10⁹⁹(100-digit number)
92702520814726467908…55087415472409804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.854 × 10¹⁰⁰(101-digit number)
18540504162945293581…10174830944819609601
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,957,227 XPM·at block #6,839,118 · 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