Block #2,634,072

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 6:10:27 PM · Difficulty 11.2213 · 4,196,734 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c495f42f5e598ab8d4626a629598cee6d06e3e57581ff079deafc374d878076e

Height

#2,634,072

Difficulty

11.221285

Transactions

2

Size

709 B

Version

2

Bits

0b38a629

Nonce

1,519,474,484

Timestamp

4/28/2018, 6:10:27 PM

Confirmations

4,196,734

Merkle Root

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

5.536 × 10⁹⁵(96-digit number)
55365771012492407972…61010217788031363199
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
5.536 × 10⁹⁵(96-digit number)
55365771012492407972…61010217788031363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.107 × 10⁹⁶(97-digit number)
11073154202498481594…22020435576062726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.214 × 10⁹⁶(97-digit number)
22146308404996963189…44040871152125452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.429 × 10⁹⁶(97-digit number)
44292616809993926378…88081742304250905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.858 × 10⁹⁶(97-digit number)
88585233619987852756…76163484608501811199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.771 × 10⁹⁷(98-digit number)
17717046723997570551…52326969217003622399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.543 × 10⁹⁷(98-digit number)
35434093447995141102…04653938434007244799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.086 × 10⁹⁷(98-digit number)
70868186895990282205…09307876868014489599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.417 × 10⁹⁸(99-digit number)
14173637379198056441…18615753736028979199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.834 × 10⁹⁸(99-digit number)
28347274758396112882…37231507472057958399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.669 × 10⁹⁸(99-digit number)
56694549516792225764…74463014944115916799
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,890,579 XPM·at block #6,830,805 · 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