Block #2,631,644

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2018, 6:35:36 AM · Difficulty 11.1748 · 4,195,360 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6367cf2430bba8340007c1c8b09c1e3b65ef2146471404b596c3a98d35e49d99

Height

#2,631,644

Difficulty

11.174823

Transactions

5

Size

1.99 KB

Version

2

Bits

0b2cc132

Nonce

1,427,216,902

Timestamp

4/27/2018, 6:35:36 AM

Confirmations

4,195,360

Merkle Root

8301a0df8b6fa7ee473530636542ef48c8f0f2e733ab909da5c17868b7928ad1
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.730 × 10⁹⁵(96-digit number)
47308648025599345669…39743140416114690559
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.730 × 10⁹⁵(96-digit number)
47308648025599345669…39743140416114690559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.461 × 10⁹⁵(96-digit number)
94617296051198691338…79486280832229381119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.892 × 10⁹⁶(97-digit number)
18923459210239738267…58972561664458762239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.784 × 10⁹⁶(97-digit number)
37846918420479476535…17945123328917524479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.569 × 10⁹⁶(97-digit number)
75693836840958953071…35890246657835048959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.513 × 10⁹⁷(98-digit number)
15138767368191790614…71780493315670097919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.027 × 10⁹⁷(98-digit number)
30277534736383581228…43560986631340195839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.055 × 10⁹⁷(98-digit number)
60555069472767162456…87121973262680391679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.211 × 10⁹⁸(99-digit number)
12111013894553432491…74243946525360783359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.422 × 10⁹⁸(99-digit number)
24222027789106864982…48487893050721566719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.844 × 10⁹⁸(99-digit number)
48444055578213729965…96975786101443133439
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,860,208 XPM·at block #6,827,003 · 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