Block #2,558,438

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2018, 8:44:10 AM · Difficulty 10.9917 · 4,268,120 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
012f9de3592b26f40d215587f837008b8c51f8fd599ea51f70b7ed322b60ba11

Height

#2,558,438

Difficulty

10.991677

Transactions

4

Size

2.78 KB

Version

2

Bits

0afdde86

Nonce

676,802,487

Timestamp

3/10/2018, 8:44:10 AM

Confirmations

4,268,120

Merkle Root

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

3.531 × 10⁹⁴(95-digit number)
35313001344239909543…93186139277167662959
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
3.531 × 10⁹⁴(95-digit number)
35313001344239909543…93186139277167662959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.062 × 10⁹⁴(95-digit number)
70626002688479819087…86372278554335325919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.412 × 10⁹⁵(96-digit number)
14125200537695963817…72744557108670651839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.825 × 10⁹⁵(96-digit number)
28250401075391927634…45489114217341303679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.650 × 10⁹⁵(96-digit number)
56500802150783855269…90978228434682607359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.130 × 10⁹⁶(97-digit number)
11300160430156771053…81956456869365214719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.260 × 10⁹⁶(97-digit number)
22600320860313542107…63912913738730429439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.520 × 10⁹⁶(97-digit number)
45200641720627084215…27825827477460858879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.040 × 10⁹⁶(97-digit number)
90401283441254168431…55651654954921717759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.808 × 10⁹⁷(98-digit number)
18080256688250833686…11303309909843435519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.616 × 10⁹⁷(98-digit number)
36160513376501667372…22606619819686871039
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,856,615 XPM·at block #6,826,557 · 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