Block #2,789,392

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/11/2018, 3:31:28 PM · Difficulty 11.6720 · 4,051,635 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3f624709817fad909793cf9eddab200d0767669a04dfd10b4d1e76687085cc79

Height

#2,789,392

Difficulty

11.672036

Transactions

24

Size

6.12 KB

Version

2

Bits

0bac0a87

Nonce

378,853,330

Timestamp

8/11/2018, 3:31:28 PM

Confirmations

4,051,635

Merkle Root

009a9ec8cc38f6ca7ae78be6684dd5a06df2b6a7a06d6f6555155d1c864b7cbc
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.643 × 10⁹⁵(96-digit number)
36438962607334907672…84029119277176634879
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.643 × 10⁹⁵(96-digit number)
36438962607334907672…84029119277176634879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.287 × 10⁹⁵(96-digit number)
72877925214669815345…68058238554353269759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.457 × 10⁹⁶(97-digit number)
14575585042933963069…36116477108706539519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.915 × 10⁹⁶(97-digit number)
29151170085867926138…72232954217413079039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.830 × 10⁹⁶(97-digit number)
58302340171735852276…44465908434826158079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.166 × 10⁹⁷(98-digit number)
11660468034347170455…88931816869652316159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.332 × 10⁹⁷(98-digit number)
23320936068694340910…77863633739304632319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.664 × 10⁹⁷(98-digit number)
46641872137388681821…55727267478609264639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.328 × 10⁹⁷(98-digit number)
93283744274777363642…11454534957218529279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.865 × 10⁹⁸(99-digit number)
18656748854955472728…22909069914437058559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.731 × 10⁹⁸(99-digit number)
37313497709910945456…45818139828874117119
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,972,574 XPM·at block #6,841,026 · 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