Block #2,828,542

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/7/2018, 9:34:52 AM · Difficulty 11.7116 · 4,005,137 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
93e580cd68930b24228b05b173f8128cc506db39d32fa44545fec71efa28266e

Height

#2,828,542

Difficulty

11.711599

Transactions

6

Size

1.17 KB

Version

2

Bits

0bb62b58

Nonce

1,329,667,096

Timestamp

9/7/2018, 9:34:52 AM

Confirmations

4,005,137

Merkle Root

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

1.852 × 10⁹⁵(96-digit number)
18528882168635760818…06300371127811724799
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
1.852 × 10⁹⁵(96-digit number)
18528882168635760818…06300371127811724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.705 × 10⁹⁵(96-digit number)
37057764337271521636…12600742255623449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.411 × 10⁹⁵(96-digit number)
74115528674543043273…25201484511246899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.482 × 10⁹⁶(97-digit number)
14823105734908608654…50402969022493798399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.964 × 10⁹⁶(97-digit number)
29646211469817217309…00805938044987596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.929 × 10⁹⁶(97-digit number)
59292422939634434618…01611876089975193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.185 × 10⁹⁷(98-digit number)
11858484587926886923…03223752179950387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.371 × 10⁹⁷(98-digit number)
23716969175853773847…06447504359900774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.743 × 10⁹⁷(98-digit number)
47433938351707547695…12895008719801548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.486 × 10⁹⁷(98-digit number)
94867876703415095390…25790017439603097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.897 × 10⁹⁸(99-digit number)
18973575340683019078…51580034879206195199
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,913,651 XPM·at block #6,833,678 · 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