Block #2,819,615

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/1/2018, 7:38:59 AM · Difficulty 11.7014 · 4,023,506 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f8611fb1acf5d0b349604e00fa5af8661688c757555fe28f4491c45c63dcc94

Height

#2,819,615

Difficulty

11.701423

Transactions

12

Size

3.27 KB

Version

2

Bits

0bb39079

Nonce

113,430,374

Timestamp

9/1/2018, 7:38:59 AM

Confirmations

4,023,506

Merkle Root

4b067cc3ba6fdd2d1ec68189ffcde07097ef3b2d5eb6215d03759f1d75905adf
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.

1.714 × 10⁹⁶(97-digit number)
17142344489427629009…27113617446368895999
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
1.714 × 10⁹⁶(97-digit number)
17142344489427629009…27113617446368895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.428 × 10⁹⁶(97-digit number)
34284688978855258019…54227234892737791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.856 × 10⁹⁶(97-digit number)
68569377957710516038…08454469785475583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.371 × 10⁹⁷(98-digit number)
13713875591542103207…16908939570951167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.742 × 10⁹⁷(98-digit number)
27427751183084206415…33817879141902335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.485 × 10⁹⁷(98-digit number)
54855502366168412830…67635758283804671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.097 × 10⁹⁸(99-digit number)
10971100473233682566…35271516567609343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.194 × 10⁹⁸(99-digit number)
21942200946467365132…70543033135218687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.388 × 10⁹⁸(99-digit number)
43884401892934730264…41086066270437375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.776 × 10⁹⁸(99-digit number)
87768803785869460529…82172132540874751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.755 × 10⁹⁹(100-digit number)
17553760757173892105…64344265081749503999
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,989,333 XPM·at block #6,843,120 · 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