Block #2,843,257

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/17/2018, 10:43:03 AM · Difficulty 11.7261 · 3,993,260 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
427ed507d41a773d36ad9461b7ddc9191896f82881d4d6800aaff4a820ac89bb

Height

#2,843,257

Difficulty

11.726106

Transactions

2

Size

426 B

Version

2

Bits

0bb9e211

Nonce

1,751,940,005

Timestamp

9/17/2018, 10:43:03 AM

Confirmations

3,993,260

Merkle Root

b9e034fa70987c62147f79c5234c607dfc09a8831341f18ae5ab7719f6eeace8
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.

3.984 × 10⁹³(94-digit number)
39841491536944515640…94648493406810288339
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.984 × 10⁹³(94-digit number)
39841491536944515640…94648493406810288339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.968 × 10⁹³(94-digit number)
79682983073889031280…89296986813620576679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.593 × 10⁹⁴(95-digit number)
15936596614777806256…78593973627241153359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.187 × 10⁹⁴(95-digit number)
31873193229555612512…57187947254482306719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.374 × 10⁹⁴(95-digit number)
63746386459111225024…14375894508964613439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.274 × 10⁹⁵(96-digit number)
12749277291822245004…28751789017929226879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.549 × 10⁹⁵(96-digit number)
25498554583644490009…57503578035858453759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.099 × 10⁹⁵(96-digit number)
50997109167288980019…15007156071716907519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.019 × 10⁹⁶(97-digit number)
10199421833457796003…30014312143433815039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.039 × 10⁹⁶(97-digit number)
20398843666915592007…60028624286867630079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.079 × 10⁹⁶(97-digit number)
40797687333831184015…20057248573735260159
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,936,413 XPM·at block #6,836,516 · 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