Block #2,548,368

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2018, 8:58:54 AM · Difficulty 10.9886 · 4,294,679 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e6b61d3cb5c0584cbdadb4792201506be85fe3c2826deee84fb96296c9fafe8

Height

#2,548,368

Difficulty

10.988567

Transactions

2

Size

571 B

Version

2

Bits

0afd12bd

Nonce

38,425,823

Timestamp

3/4/2018, 8:58:54 AM

Confirmations

4,294,679

Merkle Root

416d78d9b65e9ada9085d5373788b1f500ae4a51f56227a792fdd4c70e8ab707
Transactions (2)
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.

9.758 × 10⁹⁴(95-digit number)
97587968605013803580…97089104357067175039
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
9.758 × 10⁹⁴(95-digit number)
97587968605013803580…97089104357067175039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.951 × 10⁹⁵(96-digit number)
19517593721002760716…94178208714134350079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.903 × 10⁹⁵(96-digit number)
39035187442005521432…88356417428268700159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.807 × 10⁹⁵(96-digit number)
78070374884011042864…76712834856537400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.561 × 10⁹⁶(97-digit number)
15614074976802208572…53425669713074800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.122 × 10⁹⁶(97-digit number)
31228149953604417145…06851339426149601279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.245 × 10⁹⁶(97-digit number)
62456299907208834291…13702678852299202559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.249 × 10⁹⁷(98-digit number)
12491259981441766858…27405357704598405119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.498 × 10⁹⁷(98-digit number)
24982519962883533716…54810715409196810239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.996 × 10⁹⁷(98-digit number)
49965039925767067433…09621430818393620479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.993 × 10⁹⁷(98-digit number)
99930079851534134866…19242861636787240959
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,988,733 XPM·at block #6,843,046 · 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