Block #2,844,374

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/18/2018, 4:33:38 AM · Difficulty 11.7287 · 3,999,664 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f6e1ab49e67bb4e762560bcddfb997243952ff8d23481a2a0a487debb3bc92c

Height

#2,844,374

Difficulty

11.728705

Transactions

8

Size

3.16 KB

Version

2

Bits

0bba8c61

Nonce

430,529,890

Timestamp

9/18/2018, 4:33:38 AM

Confirmations

3,999,664

Merkle Root

15ba426e3cde7a49f2c43b787a231593997d7d99b459db7a814a8f45adfd5538
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.837 × 10⁹⁵(96-digit number)
68377334829426718636…31412785178475106399
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.837 × 10⁹⁵(96-digit number)
68377334829426718636…31412785178475106399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.367 × 10⁹⁶(97-digit number)
13675466965885343727…62825570356950212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.735 × 10⁹⁶(97-digit number)
27350933931770687454…25651140713900425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.470 × 10⁹⁶(97-digit number)
54701867863541374909…51302281427800851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.094 × 10⁹⁷(98-digit number)
10940373572708274981…02604562855601702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.188 × 10⁹⁷(98-digit number)
21880747145416549963…05209125711203404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.376 × 10⁹⁷(98-digit number)
43761494290833099927…10418251422406809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.752 × 10⁹⁷(98-digit number)
87522988581666199854…20836502844813619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.750 × 10⁹⁸(99-digit number)
17504597716333239970…41673005689627238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.500 × 10⁹⁸(99-digit number)
35009195432666479941…83346011379254476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.001 × 10⁹⁸(99-digit number)
70018390865332959883…66692022758508953599
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,996,682 XPM·at block #6,844,037 · 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