Block #2,840,208

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/15/2018, 9:21:31 AM · Difficulty 11.7210 · 3,993,284 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
34d8e0bea63e5d9075e8adc8e931330f88f22600050041a7d8ba716b0b14a5c6

Height

#2,840,208

Difficulty

11.720968

Transactions

58

Size

14.00 KB

Version

2

Bits

0bb89157

Nonce

426,009,228

Timestamp

9/15/2018, 9:21:31 AM

Confirmations

3,993,284

Merkle Root

be77a871c960e95d1f05470f37dbb0e0d37e67f5ae3774b13ec68d2f6048ca46
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.028 × 10⁹²(93-digit number)
90287973631848677996…14482084813473585921
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.028 × 10⁹²(93-digit number)
90287973631848677996…14482084813473585921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.805 × 10⁹³(94-digit number)
18057594726369735599…28964169626947171841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.611 × 10⁹³(94-digit number)
36115189452739471198…57928339253894343681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.223 × 10⁹³(94-digit number)
72230378905478942397…15856678507788687361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.444 × 10⁹⁴(95-digit number)
14446075781095788479…31713357015577374721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.889 × 10⁹⁴(95-digit number)
28892151562191576959…63426714031154749441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.778 × 10⁹⁴(95-digit number)
57784303124383153918…26853428062309498881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.155 × 10⁹⁵(96-digit number)
11556860624876630783…53706856124618997761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.311 × 10⁹⁵(96-digit number)
23113721249753261567…07413712249237995521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.622 × 10⁹⁵(96-digit number)
46227442499506523134…14827424498475991041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.245 × 10⁹⁵(96-digit number)
92454884999013046268…29654848996951982081
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,912,142 XPM·at block #6,833,491 · 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