Block #2,644,789

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 3:38:15 PM · Difficulty 11.7177 · 4,186,205 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bae440a7f8d78591a8c745abd6d700bc496d62f573f7573f2b604ff966b44e34

Height

#2,644,789

Difficulty

11.717656

Transactions

7

Size

1.74 KB

Version

2

Bits

0bb7b854

Nonce

69,040,927

Timestamp

5/2/2018, 3:38:15 PM

Confirmations

4,186,205

Merkle Root

ebcb95b16beb0f12c176c1f295416def1ee0625b4b89d533ed45763f1b6f5fe4
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.963 × 10⁹⁵(96-digit number)
19636693969425752354…39180919237840887521
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.963 × 10⁹⁵(96-digit number)
19636693969425752354…39180919237840887521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.927 × 10⁹⁵(96-digit number)
39273387938851504708…78361838475681775041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.854 × 10⁹⁵(96-digit number)
78546775877703009417…56723676951363550081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.570 × 10⁹⁶(97-digit number)
15709355175540601883…13447353902727100161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.141 × 10⁹⁶(97-digit number)
31418710351081203767…26894707805454200321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.283 × 10⁹⁶(97-digit number)
62837420702162407534…53789415610908400641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.256 × 10⁹⁷(98-digit number)
12567484140432481506…07578831221816801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.513 × 10⁹⁷(98-digit number)
25134968280864963013…15157662443633602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.026 × 10⁹⁷(98-digit number)
50269936561729926027…30315324887267205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.005 × 10⁹⁸(99-digit number)
10053987312345985205…60630649774534410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.010 × 10⁹⁸(99-digit number)
20107974624691970410…21261299549068820481
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,892,093 XPM·at block #6,830,993 · 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