Block #2,786,420

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/9/2018, 1:13:55 PM · Difficulty 11.6750 · 4,055,660 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c0a296dbb8035a6e7f349c36e9e814f7419653712a38e27f187e5ca57265e42f

Height

#2,786,420

Difficulty

11.674969

Transactions

36

Size

11.03 KB

Version

2

Bits

0baccac8

Nonce

1,121,363,432

Timestamp

8/9/2018, 1:13:55 PM

Confirmations

4,055,660

Merkle Root

6ba1066784faf479e70efa5e54488c07cde7453d1b245ad10182ac72c033a02a
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.

9.144 × 10⁹²(93-digit number)
91449841263932413009…23965579491815773921
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
9.144 × 10⁹²(93-digit number)
91449841263932413009…23965579491815773921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.828 × 10⁹³(94-digit number)
18289968252786482601…47931158983631547841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.657 × 10⁹³(94-digit number)
36579936505572965203…95862317967263095681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.315 × 10⁹³(94-digit number)
73159873011145930407…91724635934526191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.463 × 10⁹⁴(95-digit number)
14631974602229186081…83449271869052382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.926 × 10⁹⁴(95-digit number)
29263949204458372162…66898543738104765441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.852 × 10⁹⁴(95-digit number)
58527898408916744325…33797087476209530881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.170 × 10⁹⁵(96-digit number)
11705579681783348865…67594174952419061761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.341 × 10⁹⁵(96-digit number)
23411159363566697730…35188349904838123521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.682 × 10⁹⁵(96-digit number)
46822318727133395460…70376699809676247041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.364 × 10⁹⁵(96-digit number)
93644637454266790921…40753399619352494081
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,981,024 XPM·at block #6,842,079 · 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