Block #2,822,082

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/2/2018, 11:58:50 PM · Difficulty 11.7042 · 4,018,257 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f22ad35c30c12717d477276378d89db8955a8fb19ffea0dc7cd9a39641cd21a8

Height

#2,822,082

Difficulty

11.704231

Transactions

10

Size

1.88 KB

Version

2

Bits

0bb44877

Nonce

645,332,801

Timestamp

9/2/2018, 11:58:50 PM

Confirmations

4,018,257

Merkle Root

299b6a35dcbeec37a2bf984831213f002efef4cfa97cd584b48b4d2ecd238bd6
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.191 × 10⁹¹(92-digit number)
31918634682166999774…65579820739165630059
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.191 × 10⁹¹(92-digit number)
31918634682166999774…65579820739165630059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.383 × 10⁹¹(92-digit number)
63837269364333999549…31159641478331260119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.276 × 10⁹²(93-digit number)
12767453872866799909…62319282956662520239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.553 × 10⁹²(93-digit number)
25534907745733599819…24638565913325040479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.106 × 10⁹²(93-digit number)
51069815491467199639…49277131826650080959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.021 × 10⁹³(94-digit number)
10213963098293439927…98554263653300161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.042 × 10⁹³(94-digit number)
20427926196586879855…97108527306600323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.085 × 10⁹³(94-digit number)
40855852393173759711…94217054613200647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.171 × 10⁹³(94-digit number)
81711704786347519422…88434109226401295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.634 × 10⁹⁴(95-digit number)
16342340957269503884…76868218452802590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.268 × 10⁹⁴(95-digit number)
32684681914539007769…53736436905605181439
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,967,034 XPM·at block #6,840,338 · 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