Block #2,633,037

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 5:44:23 AM · Difficulty 11.1754 · 4,198,510 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7f5812caa626c6e7c97b24a8c5085cacaac787debfbd9db77dedbed9ffb43e73

Height

#2,633,037

Difficulty

11.175409

Transactions

5

Size

1.08 KB

Version

2

Bits

0b2ce7a1

Nonce

79,449,083

Timestamp

4/28/2018, 5:44:23 AM

Confirmations

4,198,510

Merkle Root

febae80fcfd677fb5e85891d047e65027f518ca3f4e74c5ec2e5bb35b7343dc1
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.003 × 10⁹⁵(96-digit number)
10039281929901559905…27946848428008343689
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.003 × 10⁹⁵(96-digit number)
10039281929901559905…27946848428008343689
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.007 × 10⁹⁵(96-digit number)
20078563859803119811…55893696856016687379
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.015 × 10⁹⁵(96-digit number)
40157127719606239623…11787393712033374759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.031 × 10⁹⁵(96-digit number)
80314255439212479247…23574787424066749519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.606 × 10⁹⁶(97-digit number)
16062851087842495849…47149574848133499039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.212 × 10⁹⁶(97-digit number)
32125702175684991699…94299149696266998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.425 × 10⁹⁶(97-digit number)
64251404351369983398…88598299392533996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.285 × 10⁹⁷(98-digit number)
12850280870273996679…77196598785067992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.570 × 10⁹⁷(98-digit number)
25700561740547993359…54393197570135984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.140 × 10⁹⁷(98-digit number)
51401123481095986718…08786395140271969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.028 × 10⁹⁸(99-digit number)
10280224696219197343…17572790280543938559
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,896,467 XPM·at block #6,831,546 · 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