Block #2,634,104

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 6:34:15 PM · Difficulty 11.2227 · 4,205,647 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
549d30e806809e92b61857744d0db1a49b582a1db749dde6a959252d006d95da

Height

#2,634,104

Difficulty

11.222686

Transactions

2

Size

677 B

Version

2

Bits

0b3901f1

Nonce

118,848,427

Timestamp

4/28/2018, 6:34:15 PM

Confirmations

4,205,647

Merkle Root

6df244ca885ae20a9a53196d67be5f6eec5ea56b43c76814ef3cd04b44e9d4c9
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.738 × 10⁹⁶(97-digit number)
17380518821280908248…84252903942932774399
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.738 × 10⁹⁶(97-digit number)
17380518821280908248…84252903942932774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.476 × 10⁹⁶(97-digit number)
34761037642561816497…68505807885865548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.952 × 10⁹⁶(97-digit number)
69522075285123632995…37011615771731097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.390 × 10⁹⁷(98-digit number)
13904415057024726599…74023231543462195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.780 × 10⁹⁷(98-digit number)
27808830114049453198…48046463086924390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.561 × 10⁹⁷(98-digit number)
55617660228098906396…96092926173848780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.112 × 10⁹⁸(99-digit number)
11123532045619781279…92185852347697561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.224 × 10⁹⁸(99-digit number)
22247064091239562558…84371704695395123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.449 × 10⁹⁸(99-digit number)
44494128182479125116…68743409390790246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.898 × 10⁹⁸(99-digit number)
88988256364958250233…37486818781580492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.779 × 10⁹⁹(100-digit number)
17797651272991650046…74973637563160985599
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,962,294 XPM·at block #6,839,750 · 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