Block #2,894,232

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/24/2018, 1:25:12 AM · Difficulty 11.6145 · 3,949,439 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5007784ad09fd75475e646d187ddd27699ac32dfc0573277eaeb0781c5dd3dc9

Height

#2,894,232

Difficulty

11.614472

Transactions

25

Size

6.95 KB

Version

2

Bits

0b9d4e0d

Nonce

1,249,732,577

Timestamp

10/24/2018, 1:25:12 AM

Confirmations

3,949,439

Merkle Root

c29aa1f554d91ea3976476d68a5f6ba2842ed3b01d5e47894629ed54a28303b4
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.

2.121 × 10⁹⁶(97-digit number)
21217469133146267929…32385597725448939521
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
2.121 × 10⁹⁶(97-digit number)
21217469133146267929…32385597725448939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.243 × 10⁹⁶(97-digit number)
42434938266292535859…64771195450897879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.486 × 10⁹⁶(97-digit number)
84869876532585071719…29542390901795758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.697 × 10⁹⁷(98-digit number)
16973975306517014343…59084781803591516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.394 × 10⁹⁷(98-digit number)
33947950613034028687…18169563607183032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.789 × 10⁹⁷(98-digit number)
67895901226068057375…36339127214366064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.357 × 10⁹⁸(99-digit number)
13579180245213611475…72678254428732129281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.715 × 10⁹⁸(99-digit number)
27158360490427222950…45356508857464258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.431 × 10⁹⁸(99-digit number)
54316720980854445900…90713017714928517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.086 × 10⁹⁹(100-digit number)
10863344196170889180…81426035429857034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.172 × 10⁹⁹(100-digit number)
21726688392341778360…62852070859714068481
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,993,741 XPM·at block #6,843,670 · 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