Block #2,841,797

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/16/2018, 11:42:33 AM · Difficulty 11.7215 · 3,999,757 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
605f8aa444dca4d227608a3ac794dd4866fce76e58728067dd3395fcb89c4357

Height

#2,841,797

Difficulty

11.721492

Transactions

2

Size

427 B

Version

2

Bits

0bb8b3b1

Nonce

279,558,018

Timestamp

9/16/2018, 11:42:33 AM

Confirmations

3,999,757

Merkle Root

c287a2339186e6c7a2ee8d6ba5050c4a237f82cc5816248cbee64b06ae55ec5a
Transactions (2)
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.831 × 10⁹⁴(95-digit number)
18313791136271678713…45821282487952350799
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.831 × 10⁹⁴(95-digit number)
18313791136271678713…45821282487952350799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.662 × 10⁹⁴(95-digit number)
36627582272543357427…91642564975904701599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.325 × 10⁹⁴(95-digit number)
73255164545086714855…83285129951809403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.465 × 10⁹⁵(96-digit number)
14651032909017342971…66570259903618806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.930 × 10⁹⁵(96-digit number)
29302065818034685942…33140519807237612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.860 × 10⁹⁵(96-digit number)
58604131636069371884…66281039614475225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.172 × 10⁹⁶(97-digit number)
11720826327213874376…32562079228950451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.344 × 10⁹⁶(97-digit number)
23441652654427748753…65124158457900902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.688 × 10⁹⁶(97-digit number)
46883305308855497507…30248316915801804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.376 × 10⁹⁶(97-digit number)
93766610617710995014…60496633831603609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.875 × 10⁹⁷(98-digit number)
18753322123542199002…20993267663207219199
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,976,817 XPM·at block #6,841,553 · 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