Block #2,559,675

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2018, 3:41:10 AM · Difficulty 10.9919 · 4,271,666 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8c7e4ae653efd781b28e40d26838fb79f8e5bbd0bd8150eed9d00dd54db5c84e

Height

#2,559,675

Difficulty

10.991877

Transactions

2

Size

723 B

Version

2

Bits

0afdeba8

Nonce

1,683,900,871

Timestamp

3/11/2018, 3:41:10 AM

Confirmations

4,271,666

Merkle Root

663071b0ebf1d9d928e2eff3b4277ce76ddca3a10dcbeea6587a41bc42ec0bb8
Transactions (2)
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.073 × 10⁹⁴(95-digit number)
10734482168965919692…64482800318778009141
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.073 × 10⁹⁴(95-digit number)
10734482168965919692…64482800318778009141
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.146 × 10⁹⁴(95-digit number)
21468964337931839384…28965600637556018281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.293 × 10⁹⁴(95-digit number)
42937928675863678769…57931201275112036561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.587 × 10⁹⁴(95-digit number)
85875857351727357538…15862402550224073121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.717 × 10⁹⁵(96-digit number)
17175171470345471507…31724805100448146241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.435 × 10⁹⁵(96-digit number)
34350342940690943015…63449610200896292481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.870 × 10⁹⁵(96-digit number)
68700685881381886030…26899220401792584961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.374 × 10⁹⁶(97-digit number)
13740137176276377206…53798440803585169921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.748 × 10⁹⁶(97-digit number)
27480274352552754412…07596881607170339841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.496 × 10⁹⁶(97-digit number)
54960548705105508824…15193763214340679681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.099 × 10⁹⁷(98-digit number)
10992109741021101764…30387526428681359361
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,894,882 XPM·at block #6,831,340 · 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