Block #2,295,903

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/14/2017, 11:53:08 AM · Difficulty 10.9511 · 4,546,560 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cfd1e22182d098aa08885b721f7aedccfd9f7b3e0944a6e514fa0fe26fa96958

Height

#2,295,903

Difficulty

10.951134

Transactions

20

Size

4.26 KB

Version

2

Bits

0af37d8c

Nonce

343,047,463

Timestamp

9/14/2017, 11:53:08 AM

Confirmations

4,546,560

Merkle Root

78ac02ef8d5aa130938e6524fdfed061b5e97d9f17cb7fc42e1b5e199f173479
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.

4.070 × 10⁹⁶(97-digit number)
40703883663773992342…32910307594810572801
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
4.070 × 10⁹⁶(97-digit number)
40703883663773992342…32910307594810572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.140 × 10⁹⁶(97-digit number)
81407767327547984684…65820615189621145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.628 × 10⁹⁷(98-digit number)
16281553465509596936…31641230379242291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.256 × 10⁹⁷(98-digit number)
32563106931019193873…63282460758484582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.512 × 10⁹⁷(98-digit number)
65126213862038387747…26564921516969164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.302 × 10⁹⁸(99-digit number)
13025242772407677549…53129843033938329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.605 × 10⁹⁸(99-digit number)
26050485544815355099…06259686067876659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.210 × 10⁹⁸(99-digit number)
52100971089630710198…12519372135753318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.042 × 10⁹⁹(100-digit number)
10420194217926142039…25038744271506636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.084 × 10⁹⁹(100-digit number)
20840388435852284079…50077488543013273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.168 × 10⁹⁹(100-digit number)
41680776871704568158…00154977086026547201
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,984,122 XPM·at block #6,842,462 · 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