Block #2,561,954

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2018, 10:40:59 AM · Difficulty 10.9926 · 4,280,893 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
749632a2488ae4642bc3c11fbfee3c7572dc2dc3d8f72472e3ebc73705fe10d4

Height

#2,561,954

Difficulty

10.992589

Transactions

6

Size

1.89 KB

Version

2

Bits

0afe1a58

Nonce

481,731,313

Timestamp

3/12/2018, 10:40:59 AM

Confirmations

4,280,893

Merkle Root

7b93d2cf8934c8a163f08d0af9b68f19d0f5804372c3123905d66dc1e7113be8
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.186 × 10⁹⁶(97-digit number)
11863347517668998170…88699388565314362881
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.186 × 10⁹⁶(97-digit number)
11863347517668998170…88699388565314362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.372 × 10⁹⁶(97-digit number)
23726695035337996340…77398777130628725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.745 × 10⁹⁶(97-digit number)
47453390070675992681…54797554261257451521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.490 × 10⁹⁶(97-digit number)
94906780141351985363…09595108522514903041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.898 × 10⁹⁷(98-digit number)
18981356028270397072…19190217045029806081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.796 × 10⁹⁷(98-digit number)
37962712056540794145…38380434090059612161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.592 × 10⁹⁷(98-digit number)
75925424113081588290…76760868180119224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.518 × 10⁹⁸(99-digit number)
15185084822616317658…53521736360238448641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.037 × 10⁹⁸(99-digit number)
30370169645232635316…07043472720476897281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.074 × 10⁹⁸(99-digit number)
60740339290465270632…14086945440953794561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,987,121 XPM·at block #6,842,846 · 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