Block #2,642,771

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 8:47:22 PM · Difficulty 11.6633 · 4,188,218 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bb93e55bcfc709bbb1eec09f237c28f36fe210ec874200fba383a06a3543be47

Height

#2,642,771

Difficulty

11.663293

Transactions

6

Size

14.97 KB

Version

2

Bits

0ba9cd93

Nonce

333,126,721

Timestamp

5/1/2018, 8:47:22 PM

Confirmations

4,188,218

Merkle Root

5f7481dc1935016f96e11863c2a4152b65f28012a6b66d09d272cb67adbdd5dd
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.284 × 10⁹⁴(95-digit number)
42846755019607311837…61471720045170833081
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.284 × 10⁹⁴(95-digit number)
42846755019607311837…61471720045170833081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.569 × 10⁹⁴(95-digit number)
85693510039214623674…22943440090341666161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.713 × 10⁹⁵(96-digit number)
17138702007842924734…45886880180683332321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.427 × 10⁹⁵(96-digit number)
34277404015685849469…91773760361366664641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.855 × 10⁹⁵(96-digit number)
68554808031371698939…83547520722733329281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.371 × 10⁹⁶(97-digit number)
13710961606274339787…67095041445466658561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.742 × 10⁹⁶(97-digit number)
27421923212548679575…34190082890933317121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.484 × 10⁹⁶(97-digit number)
54843846425097359151…68380165781866634241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.096 × 10⁹⁷(98-digit number)
10968769285019471830…36760331563733268481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.193 × 10⁹⁷(98-digit number)
21937538570038943660…73520663127466536961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.387 × 10⁹⁷(98-digit number)
43875077140077887321…47041326254933073921
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,052 XPM·at block #6,830,988 · 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