Block #2,709,342

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/17/2018, 7:18:48 PM · Difficulty 11.5908 · 4,128,848 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
397c2076f59d622d132c457bb5ad6929172b60e08fe87337aa46d501ced3affd

Height

#2,709,342

Difficulty

11.590759

Transactions

2

Size

426 B

Version

2

Bits

0b973bf6

Nonce

184,014,000

Timestamp

6/17/2018, 7:18:48 PM

Confirmations

4,128,848

Merkle Root

208612bad6ba3b02e89f26f79fde4a4f70196cee0825a4d56821f0412f1fd659
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.

5.649 × 10⁹⁷(98-digit number)
56492557773103638888…90495298453340958721
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
5.649 × 10⁹⁷(98-digit number)
56492557773103638888…90495298453340958721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.129 × 10⁹⁸(99-digit number)
11298511554620727777…80990596906681917441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.259 × 10⁹⁸(99-digit number)
22597023109241455555…61981193813363834881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.519 × 10⁹⁸(99-digit number)
45194046218482911110…23962387626727669761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.038 × 10⁹⁸(99-digit number)
90388092436965822221…47924775253455339521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.807 × 10⁹⁹(100-digit number)
18077618487393164444…95849550506910679041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.615 × 10⁹⁹(100-digit number)
36155236974786328888…91699101013821358081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.231 × 10⁹⁹(100-digit number)
72310473949572657777…83398202027642716161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.446 × 10¹⁰⁰(101-digit number)
14462094789914531555…66796404055285432321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.892 × 10¹⁰⁰(101-digit number)
28924189579829063110…33592808110570864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.784 × 10¹⁰⁰(101-digit number)
57848379159658126221…67185616221141729281
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,949,795 XPM·at block #6,838,189 · 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