Block #2,839,344

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/14/2018, 7:08:09 PM · Difficulty 11.7204 · 3,993,869 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1dfc8b2a40a26bc8fc64d38c183469d224cb63ea84289a16516cdf0ad5feccb2

Height

#2,839,344

Difficulty

11.720414

Transactions

32

Size

9.01 KB

Version

2

Bits

0bb86d10

Nonce

71,311,478

Timestamp

9/14/2018, 7:08:09 PM

Confirmations

3,993,869

Merkle Root

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

9.919 × 10⁹⁴(95-digit number)
99192431396619061996…47156463501638637119
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
9.919 × 10⁹⁴(95-digit number)
99192431396619061996…47156463501638637119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.983 × 10⁹⁵(96-digit number)
19838486279323812399…94312927003277274239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.967 × 10⁹⁵(96-digit number)
39676972558647624798…88625854006554548479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.935 × 10⁹⁵(96-digit number)
79353945117295249596…77251708013109096959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.587 × 10⁹⁶(97-digit number)
15870789023459049919…54503416026218193919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.174 × 10⁹⁶(97-digit number)
31741578046918099838…09006832052436387839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.348 × 10⁹⁶(97-digit number)
63483156093836199677…18013664104872775679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.269 × 10⁹⁷(98-digit number)
12696631218767239935…36027328209745551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.539 × 10⁹⁷(98-digit number)
25393262437534479871…72054656419491102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.078 × 10⁹⁷(98-digit number)
50786524875068959742…44109312838982205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.015 × 10⁹⁸(99-digit number)
10157304975013791948…88218625677964410879
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,909,890 XPM·at block #6,833,212 · 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