Block #2,633,774

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 2:39:16 PM · Difficulty 11.2078 · 4,196,748 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c7c41bacd8e3935b1fc21795a3f2efb623e39456b104a32f22d83121af968902

Height

#2,633,774

Difficulty

11.207840

Transactions

7

Size

2.43 KB

Version

2

Bits

0b3534fe

Nonce

137,237,994

Timestamp

4/28/2018, 2:39:16 PM

Confirmations

4,196,748

Merkle Root

15839cef3df341d4ad1a891391d8a9d563786fcd7b25727eeafa2fc5f53100eb
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.234 × 10⁹⁶(97-digit number)
32344927049384281567…89638306268947041279
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.234 × 10⁹⁶(97-digit number)
32344927049384281567…89638306268947041279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.468 × 10⁹⁶(97-digit number)
64689854098768563134…79276612537894082559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.293 × 10⁹⁷(98-digit number)
12937970819753712626…58553225075788165119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.587 × 10⁹⁷(98-digit number)
25875941639507425253…17106450151576330239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.175 × 10⁹⁷(98-digit number)
51751883279014850507…34212900303152660479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.035 × 10⁹⁸(99-digit number)
10350376655802970101…68425800606305320959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.070 × 10⁹⁸(99-digit number)
20700753311605940203…36851601212610641919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.140 × 10⁹⁸(99-digit number)
41401506623211880406…73703202425221283839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.280 × 10⁹⁸(99-digit number)
82803013246423760812…47406404850442567679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.656 × 10⁹⁹(100-digit number)
16560602649284752162…94812809700885135359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.312 × 10⁹⁹(100-digit number)
33121205298569504325…89625619401770270719
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,888,428 XPM·at block #6,830,521 · 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