Block #2,781,286

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2018, 5:45:22 AM · Difficulty 11.6503 · 4,061,612 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a02cd4ea211d2dc028ed1fb43f8c7c7dcf8310a6beff962dd5601a99505b4ec9

Height

#2,781,286

Difficulty

11.650343

Transactions

2

Size

3.74 KB

Version

2

Bits

0ba67ce5

Nonce

1,669,044,621

Timestamp

8/6/2018, 5:45:22 AM

Confirmations

4,061,612

Merkle Root

501e953a63c22b283531f374b6a480f815f8991ed368de36a2838330ff58f6d9
Transactions (2)
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.

3.141 × 10⁹¹(92-digit number)
31416936454794593758…26299909383458740161
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
3.141 × 10⁹¹(92-digit number)
31416936454794593758…26299909383458740161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.283 × 10⁹¹(92-digit number)
62833872909589187516…52599818766917480321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.256 × 10⁹²(93-digit number)
12566774581917837503…05199637533834960641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.513 × 10⁹²(93-digit number)
25133549163835675006…10399275067669921281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.026 × 10⁹²(93-digit number)
50267098327671350013…20798550135339842561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.005 × 10⁹³(94-digit number)
10053419665534270002…41597100270679685121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.010 × 10⁹³(94-digit number)
20106839331068540005…83194200541359370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.021 × 10⁹³(94-digit number)
40213678662137080010…66388401082718740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.042 × 10⁹³(94-digit number)
80427357324274160021…32776802165437480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.608 × 10⁹⁴(95-digit number)
16085471464854832004…65553604330874961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.217 × 10⁹⁴(95-digit number)
32170942929709664008…31107208661749923841
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,987,532 XPM·at block #6,842,897 · 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