Block #2,495,287

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/29/2018, 2:46:45 AM · Difficulty 10.9736 · 4,346,378 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8c7bdd85daa23f9a6bd099056473436cad2e5a79ad9f97617d305532cd6adddf

Height

#2,495,287

Difficulty

10.973581

Transactions

26

Size

8.49 KB

Version

2

Bits

0af93c9b

Nonce

29,558,145

Timestamp

1/29/2018, 2:46:45 AM

Confirmations

4,346,378

Merkle Root

045affef890dcc312e65cfdb1b382d298abf5d4d8de4568d44e246c704521279
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.078 × 10⁹⁵(96-digit number)
10784576324265294927…81939565957985037601
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.078 × 10⁹⁵(96-digit number)
10784576324265294927…81939565957985037601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.156 × 10⁹⁵(96-digit number)
21569152648530589854…63879131915970075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.313 × 10⁹⁵(96-digit number)
43138305297061179709…27758263831940150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.627 × 10⁹⁵(96-digit number)
86276610594122359418…55516527663880300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.725 × 10⁹⁶(97-digit number)
17255322118824471883…11033055327760601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.451 × 10⁹⁶(97-digit number)
34510644237648943767…22066110655521203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.902 × 10⁹⁶(97-digit number)
69021288475297887534…44132221311042406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.380 × 10⁹⁷(98-digit number)
13804257695059577506…88264442622084812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.760 × 10⁹⁷(98-digit number)
27608515390119155013…76528885244169625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.521 × 10⁹⁷(98-digit number)
55217030780238310027…53057770488339251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.104 × 10⁹⁸(99-digit number)
11043406156047662005…06115540976678502401
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,977,709 XPM·at block #6,841,664 · 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