Block #2,256,552

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/18/2017, 1:32:30 AM · Difficulty 10.9513 · 4,588,466 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
47922f43ae09fb712baf9a22539a960aaeab3ccece9541e03eb1ad49014ef754

Height

#2,256,552

Difficulty

10.951255

Transactions

3

Size

2.08 KB

Version

2

Bits

0af3856b

Nonce

301,431,853

Timestamp

8/18/2017, 1:32:30 AM

Confirmations

4,588,466

Merkle Root

d1bf42cda436517592a4cd21488a125c94c1a2e70dba792994c3c7e58705d284
Transactions (3)
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.

6.215 × 10⁹⁶(97-digit number)
62154365700968810246…02835608333059525119
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
6.215 × 10⁹⁶(97-digit number)
62154365700968810246…02835608333059525119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.243 × 10⁹⁷(98-digit number)
12430873140193762049…05671216666119050239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.486 × 10⁹⁷(98-digit number)
24861746280387524098…11342433332238100479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.972 × 10⁹⁷(98-digit number)
49723492560775048197…22684866664476200959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.944 × 10⁹⁷(98-digit number)
99446985121550096394…45369733328952401919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.988 × 10⁹⁸(99-digit number)
19889397024310019278…90739466657904803839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.977 × 10⁹⁸(99-digit number)
39778794048620038557…81478933315809607679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.955 × 10⁹⁸(99-digit number)
79557588097240077115…62957866631619215359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.591 × 10⁹⁹(100-digit number)
15911517619448015423…25915733263238430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.182 × 10⁹⁹(100-digit number)
31823035238896030846…51831466526476861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.364 × 10⁹⁹(100-digit number)
63646070477792061692…03662933052953722879
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:58,004,567 XPM·at block #6,845,017 · 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