Block #2,634,633

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 11:26:29 PM · Difficulty 11.2583 · 4,197,091 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b1c370eb213d5955932adf6a4bb303724b95a8681a351940218e2265997a0ce7

Height

#2,634,633

Difficulty

11.258280

Transactions

5

Size

1.51 KB

Version

2

Bits

0b421ea8

Nonce

192,761,959

Timestamp

4/28/2018, 11:26:29 PM

Confirmations

4,197,091

Merkle Root

210f4cec5e705061facc09ee580f78345191df2625b594b393c2e43a0cd1dd72
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.

7.252 × 10⁹⁵(96-digit number)
72528635755618386703…82353472971335987199
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
7.252 × 10⁹⁵(96-digit number)
72528635755618386703…82353472971335987199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.450 × 10⁹⁶(97-digit number)
14505727151123677340…64706945942671974399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.901 × 10⁹⁶(97-digit number)
29011454302247354681…29413891885343948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.802 × 10⁹⁶(97-digit number)
58022908604494709362…58827783770687897599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.160 × 10⁹⁷(98-digit number)
11604581720898941872…17655567541375795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.320 × 10⁹⁷(98-digit number)
23209163441797883745…35311135082751590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.641 × 10⁹⁷(98-digit number)
46418326883595767490…70622270165503180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.283 × 10⁹⁷(98-digit number)
92836653767191534980…41244540331006361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.856 × 10⁹⁸(99-digit number)
18567330753438306996…82489080662012723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.713 × 10⁹⁸(99-digit number)
37134661506876613992…64978161324025446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.426 × 10⁹⁸(99-digit number)
74269323013753227984…29956322648050892799
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,897,897 XPM·at block #6,831,723 · 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