Block #2,745,218

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/12/2018, 5:11:26 AM · Difficulty 11.6468 · 4,093,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
3e69da85b6a8f046469cdf7285e6db071a3b539a462d9277ba4146a19f13a46a

Height

#2,745,218

Difficulty

11.646762

Transactions

9

Size

2.52 KB

Version

2

Bits

0ba59237

Nonce

1,020,201,311

Timestamp

7/12/2018, 5:11:26 AM

Confirmations

4,093,580

Merkle Root

9a112ffc434f0bd8805eef80b60472a37706f1eb68c01aa0fdba6e72a36a12e1
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.279 × 10⁹⁵(96-digit number)
12791759538331233057…12117486125167878901
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.279 × 10⁹⁵(96-digit number)
12791759538331233057…12117486125167878901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.558 × 10⁹⁵(96-digit number)
25583519076662466114…24234972250335757801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.116 × 10⁹⁵(96-digit number)
51167038153324932229…48469944500671515601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.023 × 10⁹⁶(97-digit number)
10233407630664986445…96939889001343031201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.046 × 10⁹⁶(97-digit number)
20466815261329972891…93879778002686062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.093 × 10⁹⁶(97-digit number)
40933630522659945783…87759556005372124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.186 × 10⁹⁶(97-digit number)
81867261045319891567…75519112010744249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.637 × 10⁹⁷(98-digit number)
16373452209063978313…51038224021488499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.274 × 10⁹⁷(98-digit number)
32746904418127956626…02076448042976998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.549 × 10⁹⁷(98-digit number)
65493808836255913253…04152896085953996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.309 × 10⁹⁸(99-digit number)
13098761767251182650…08305792171907993601
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,954,648 XPM·at block #6,838,797 · 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