Block #2,803,533

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/21/2018, 12:54:18 PM · Difficulty 11.6659 · 4,039,592 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1e3f3bd981b60671d467fbf084c0de3f3271971f00d480b9f20a1e26df88282d

Height

#2,803,533

Difficulty

11.665947

Transactions

3

Size

651 B

Version

2

Bits

0baa7b82

Nonce

1,129,168,445

Timestamp

8/21/2018, 12:54:18 PM

Confirmations

4,039,592

Merkle Root

e443620ad16fb47df07ad2f23a30066091370404d2f700683dd928428884da8d
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.040 × 10⁹⁴(95-digit number)
20407322675535378979…10988789081656336001
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.040 × 10⁹⁴(95-digit number)
20407322675535378979…10988789081656336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.081 × 10⁹⁴(95-digit number)
40814645351070757959…21977578163312672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.162 × 10⁹⁴(95-digit number)
81629290702141515918…43955156326625344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.632 × 10⁹⁵(96-digit number)
16325858140428303183…87910312653250688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.265 × 10⁹⁵(96-digit number)
32651716280856606367…75820625306501376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.530 × 10⁹⁵(96-digit number)
65303432561713212734…51641250613002752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.306 × 10⁹⁶(97-digit number)
13060686512342642546…03282501226005504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.612 × 10⁹⁶(97-digit number)
26121373024685285093…06565002452011008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.224 × 10⁹⁶(97-digit number)
52242746049370570187…13130004904022016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.044 × 10⁹⁷(98-digit number)
10448549209874114037…26260009808044032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.089 × 10⁹⁷(98-digit number)
20897098419748228075…52520019616088064001
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,989,366 XPM·at block #6,843,124 · 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