Block #2,633,496

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 11:31:11 AM · Difficulty 11.1938 · 4,197,170 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c5e659a511c0420d38843e3959fab33f776f3991911661ca67891e3e9b17e9a5

Height

#2,633,496

Difficulty

11.193795

Transactions

4

Size

2.06 KB

Version

2

Bits

0b319c8f

Nonce

489,946,618

Timestamp

4/28/2018, 11:31:11 AM

Confirmations

4,197,170

Merkle Root

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

4.350 × 10⁹⁴(95-digit number)
43504148315089274675…75624666397454645519
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
4.350 × 10⁹⁴(95-digit number)
43504148315089274675…75624666397454645519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.700 × 10⁹⁴(95-digit number)
87008296630178549351…51249332794909291039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.740 × 10⁹⁵(96-digit number)
17401659326035709870…02498665589818582079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.480 × 10⁹⁵(96-digit number)
34803318652071419740…04997331179637164159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.960 × 10⁹⁵(96-digit number)
69606637304142839480…09994662359274328319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.392 × 10⁹⁶(97-digit number)
13921327460828567896…19989324718548656639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.784 × 10⁹⁶(97-digit number)
27842654921657135792…39978649437097313279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.568 × 10⁹⁶(97-digit number)
55685309843314271584…79957298874194626559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.113 × 10⁹⁷(98-digit number)
11137061968662854316…59914597748389253119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.227 × 10⁹⁷(98-digit number)
22274123937325708633…19829195496778506239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.454 × 10⁹⁷(98-digit number)
44548247874651417267…39658390993557012479
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,889,456 XPM·at block #6,830,665 · 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