Block #2,825,870

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/5/2018, 1:25:52 PM · Difficulty 11.7102 · 4,014,339 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
400007a17636d6c13d5d319645c29c9aba60dbef308fc0e78545797d620f69a7

Height

#2,825,870

Difficulty

11.710186

Transactions

6

Size

1.87 KB

Version

2

Bits

0bb5ceb9

Nonce

256,601,519

Timestamp

9/5/2018, 1:25:52 PM

Confirmations

4,014,339

Merkle Root

e13f75f0c2adaab9eefc691ad7103558b4ae35d0fe160a11498077f9467e78c0
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.550 × 10⁹³(94-digit number)
55500474724250525089…30768035833470957561
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.550 × 10⁹³(94-digit number)
55500474724250525089…30768035833470957561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.110 × 10⁹⁴(95-digit number)
11100094944850105017…61536071666941915121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.220 × 10⁹⁴(95-digit number)
22200189889700210035…23072143333883830241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.440 × 10⁹⁴(95-digit number)
44400379779400420071…46144286667767660481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.880 × 10⁹⁴(95-digit number)
88800759558800840143…92288573335535320961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.776 × 10⁹⁵(96-digit number)
17760151911760168028…84577146671070641921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.552 × 10⁹⁵(96-digit number)
35520303823520336057…69154293342141283841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.104 × 10⁹⁵(96-digit number)
71040607647040672114…38308586684282567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.420 × 10⁹⁶(97-digit number)
14208121529408134422…76617173368565135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.841 × 10⁹⁶(97-digit number)
28416243058816268845…53234346737130270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.683 × 10⁹⁶(97-digit number)
56832486117632537691…06468693474260541441
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,965,990 XPM·at block #6,840,208 · 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