Block #2,635,604

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2018, 7:25:41 AM · Difficulty 11.3273 · 4,196,980 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3d5802bf0086433f07b9866faad2743de50d4e0f6d12859d99db5d168923d8ff

Height

#2,635,604

Difficulty

11.327264

Transactions

10

Size

3.01 KB

Version

2

Bits

0b53c792

Nonce

305,674,452

Timestamp

4/29/2018, 7:25:41 AM

Confirmations

4,196,980

Merkle Root

fe38439bec3ab566bef3613a2cbf4c2086904f9616f735a473c8f9a2edc4294d
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.658 × 10⁹⁶(97-digit number)
26587206573654968894…38189584415728172799
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.658 × 10⁹⁶(97-digit number)
26587206573654968894…38189584415728172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.317 × 10⁹⁶(97-digit number)
53174413147309937788…76379168831456345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.063 × 10⁹⁷(98-digit number)
10634882629461987557…52758337662912691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.126 × 10⁹⁷(98-digit number)
21269765258923975115…05516675325825382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.253 × 10⁹⁷(98-digit number)
42539530517847950230…11033350651650764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.507 × 10⁹⁷(98-digit number)
85079061035695900461…22066701303301529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.701 × 10⁹⁸(99-digit number)
17015812207139180092…44133402606603059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.403 × 10⁹⁸(99-digit number)
34031624414278360184…88266805213206118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.806 × 10⁹⁸(99-digit number)
68063248828556720369…76533610426412236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.361 × 10⁹⁹(100-digit number)
13612649765711344073…53067220852824473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.722 × 10⁹⁹(100-digit number)
27225299531422688147…06134441705648947199
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,904,820 XPM·at block #6,832,583 · 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