Block #2,824,846

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/4/2018, 8:45:01 PM · Difficulty 11.7090 · 4,015,726 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
84eb69c79ec3a90c8339135db783cea8d302fb200e250c02bb5adf371b0e1af1

Height

#2,824,846

Difficulty

11.708977

Transactions

7

Size

2.84 KB

Version

2

Bits

0bb57f88

Nonce

1,349,940,673

Timestamp

9/4/2018, 8:45:01 PM

Confirmations

4,015,726

Merkle Root

4a6ec84c996f190d223679ef9d4068e33909f3030397975004d6c6f1728e0826
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.

2.092 × 10⁹⁴(95-digit number)
20926620651492032177…22738878839580578679
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
2.092 × 10⁹⁴(95-digit number)
20926620651492032177…22738878839580578679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.185 × 10⁹⁴(95-digit number)
41853241302984064354…45477757679161157359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.370 × 10⁹⁴(95-digit number)
83706482605968128708…90955515358322314719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.674 × 10⁹⁵(96-digit number)
16741296521193625741…81911030716644629439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.348 × 10⁹⁵(96-digit number)
33482593042387251483…63822061433289258879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.696 × 10⁹⁵(96-digit number)
66965186084774502967…27644122866578517759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.339 × 10⁹⁶(97-digit number)
13393037216954900593…55288245733157035519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.678 × 10⁹⁶(97-digit number)
26786074433909801186…10576491466314071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.357 × 10⁹⁶(97-digit number)
53572148867819602373…21152982932628142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.071 × 10⁹⁷(98-digit number)
10714429773563920474…42305965865256284159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.142 × 10⁹⁷(98-digit number)
21428859547127840949…84611931730512568319
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,968,911 XPM·at block #6,840,571 · 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