Block #2,687,942

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2018, 1:58:00 AM · Difficulty 11.6793 · 4,146,018 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4208f6370ea6e735a1e895bcc9c061b64d8fb23b0b37343b7014820f4fc26d75

Height

#2,687,942

Difficulty

11.679325

Transactions

4

Size

1.30 KB

Version

2

Bits

0bade841

Nonce

226,639,230

Timestamp

6/2/2018, 1:58:00 AM

Confirmations

4,146,018

Merkle Root

7533a76ed1d48580f620ac0482fad973b31a0020d7d27b55d578d67edf291482
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.735 × 10⁹⁶(97-digit number)
37355540562721106470…49224067567814039039
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.735 × 10⁹⁶(97-digit number)
37355540562721106470…49224067567814039039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.471 × 10⁹⁶(97-digit number)
74711081125442212940…98448135135628078079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.494 × 10⁹⁷(98-digit number)
14942216225088442588…96896270271256156159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.988 × 10⁹⁷(98-digit number)
29884432450176885176…93792540542512312319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.976 × 10⁹⁷(98-digit number)
59768864900353770352…87585081085024624639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.195 × 10⁹⁸(99-digit number)
11953772980070754070…75170162170049249279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.390 × 10⁹⁸(99-digit number)
23907545960141508141…50340324340098498559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.781 × 10⁹⁸(99-digit number)
47815091920283016282…00680648680196997119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.563 × 10⁹⁸(99-digit number)
95630183840566032564…01361297360393994239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.912 × 10⁹⁹(100-digit number)
19126036768113206512…02722594720787988479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.825 × 10⁹⁹(100-digit number)
38252073536226413025…05445189441575976959
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,915,908 XPM·at block #6,833,959 · 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