Block #2,149,739

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/7/2017, 6:31:39 AM · Difficulty 10.8983 · 4,668,082 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a2a840bdffef481e11b6b376c7b5bb64ec0bdcf30347eb38148ce44f04cf4b1c

Height

#2,149,739

Difficulty

10.898333

Transactions

3

Size

584 B

Version

2

Bits

0ae5f91f

Nonce

1,004,871,414

Timestamp

6/7/2017, 6:31:39 AM

Confirmations

4,668,082

Merkle Root

5e166b620f56c1306e9037cad1439cce9f0b888929a2a7b1a99aae86d9f003d8
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.

4.435 × 10⁹²(93-digit number)
44354058080150781954…58854848260480908401
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
4.435 × 10⁹²(93-digit number)
44354058080150781954…58854848260480908401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.870 × 10⁹²(93-digit number)
88708116160301563909…17709696520961816801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.774 × 10⁹³(94-digit number)
17741623232060312781…35419393041923633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.548 × 10⁹³(94-digit number)
35483246464120625563…70838786083847267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.096 × 10⁹³(94-digit number)
70966492928241251127…41677572167694534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.419 × 10⁹⁴(95-digit number)
14193298585648250225…83355144335389068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.838 × 10⁹⁴(95-digit number)
28386597171296500451…66710288670778137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.677 × 10⁹⁴(95-digit number)
56773194342593000902…33420577341556275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.135 × 10⁹⁵(96-digit number)
11354638868518600180…66841154683112550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.270 × 10⁹⁵(96-digit number)
22709277737037200360…33682309366225100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.541 × 10⁹⁵(96-digit number)
45418555474074400721…67364618732450201601
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,786,631 XPM·at block #6,817,820 · 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