Block #2,609,567

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/11/2018, 4:48:53 PM · Difficulty 11.2291 · 4,234,376 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
09aee1b5f5656dab706c1dc104add2dd5335abe2a8441981ca43be6368990315

Height

#2,609,567

Difficulty

11.229121

Transactions

3

Size

1.44 KB

Version

2

Bits

0b3aa7b1

Nonce

26,677,247

Timestamp

4/11/2018, 4:48:53 PM

Confirmations

4,234,376

Merkle Root

0b20b815cb1ca1f61f29e406746d67cd7471994e911bf83efd0309318d628831
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.

8.261 × 10⁹⁴(95-digit number)
82614680463549860858…70452452684659778561
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
8.261 × 10⁹⁴(95-digit number)
82614680463549860858…70452452684659778561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.652 × 10⁹⁵(96-digit number)
16522936092709972171…40904905369319557121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.304 × 10⁹⁵(96-digit number)
33045872185419944343…81809810738639114241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.609 × 10⁹⁵(96-digit number)
66091744370839888686…63619621477278228481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.321 × 10⁹⁶(97-digit number)
13218348874167977737…27239242954556456961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.643 × 10⁹⁶(97-digit number)
26436697748335955474…54478485909112913921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.287 × 10⁹⁶(97-digit number)
52873395496671910949…08956971818225827841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.057 × 10⁹⁷(98-digit number)
10574679099334382189…17913943636451655681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.114 × 10⁹⁷(98-digit number)
21149358198668764379…35827887272903311361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.229 × 10⁹⁷(98-digit number)
42298716397337528759…71655774545806622721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.459 × 10⁹⁷(98-digit number)
84597432794675057519…43311549091613245441
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,995,919 XPM·at block #6,843,942 · 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