Block #2,842,219

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/16/2018, 6:19:50 PM · Difficulty 11.7229 · 3,991,574 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a3ff7fa22b0f218a229c0700cc35061eb8aa65556bee93f9d71627e3295ac4b6

Height

#2,842,219

Difficulty

11.722870

Transactions

9

Size

2.05 KB

Version

2

Bits

0bb90dfa

Nonce

1,206,615,910

Timestamp

9/16/2018, 6:19:50 PM

Confirmations

3,991,574

Merkle Root

513078fd91c694f48597c149190b1533c33be11849711f2ec83827a490f08af9
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.

6.139 × 10⁹⁵(96-digit number)
61393119436108414070…87552190766149151441
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
6.139 × 10⁹⁵(96-digit number)
61393119436108414070…87552190766149151441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.227 × 10⁹⁶(97-digit number)
12278623887221682814…75104381532298302881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.455 × 10⁹⁶(97-digit number)
24557247774443365628…50208763064596605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.911 × 10⁹⁶(97-digit number)
49114495548886731256…00417526129193211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.822 × 10⁹⁶(97-digit number)
98228991097773462513…00835052258386423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.964 × 10⁹⁷(98-digit number)
19645798219554692502…01670104516772846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.929 × 10⁹⁷(98-digit number)
39291596439109385005…03340209033545692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.858 × 10⁹⁷(98-digit number)
78583192878218770010…06680418067091384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.571 × 10⁹⁸(99-digit number)
15716638575643754002…13360836134182768641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.143 × 10⁹⁸(99-digit number)
31433277151287508004…26721672268365537281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.286 × 10⁹⁸(99-digit number)
62866554302575016008…53443344536731074561
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,914,565 XPM·at block #6,833,792 · 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