Block #2,925,094

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2018, 7:14:17 AM · Difficulty 11.3553 · 3,917,735 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5722fdcb5131297be27ff1f418593224d69486cbdb707257cb38946b1c72ac4a

Height

#2,925,094

Difficulty

11.355336

Transactions

19

Size

75.64 KB

Version

2

Bits

0b5af74a

Nonce

1,334,219,424

Timestamp

11/16/2018, 7:14:17 AM

Confirmations

3,917,735

Merkle Root

7cdb6546d480fb11cb774e1ba21e00c54456f45b34608d11287f24a52f337c61
Transactions (19)
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.574 × 10⁹⁵(96-digit number)
15745467448369083062…59276463022673894081
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.574 × 10⁹⁵(96-digit number)
15745467448369083062…59276463022673894081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.149 × 10⁹⁵(96-digit number)
31490934896738166124…18552926045347788161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.298 × 10⁹⁵(96-digit number)
62981869793476332248…37105852090695576321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.259 × 10⁹⁶(97-digit number)
12596373958695266449…74211704181391152641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.519 × 10⁹⁶(97-digit number)
25192747917390532899…48423408362782305281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.038 × 10⁹⁶(97-digit number)
50385495834781065798…96846816725564610561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.007 × 10⁹⁷(98-digit number)
10077099166956213159…93693633451129221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.015 × 10⁹⁷(98-digit number)
20154198333912426319…87387266902258442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.030 × 10⁹⁷(98-digit number)
40308396667824852638…74774533804516884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.061 × 10⁹⁷(98-digit number)
80616793335649705277…49549067609033768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.612 × 10⁹⁸(99-digit number)
16123358667129941055…99098135218067537921
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,986,975 XPM·at block #6,842,828 · 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