Block #2,542,327

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/28/2018, 11:00:47 AM · Difficulty 10.9874 · 4,296,989 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8a2e83917d9a99ef97763e691e7b3f53b35de6758ea0935652f76c2594de0abe

Height

#2,542,327

Difficulty

10.987433

Transactions

61

Size

18.83 KB

Version

2

Bits

0afcc86a

Nonce

1,364,932,355

Timestamp

2/28/2018, 11:00:47 AM

Confirmations

4,296,989

Merkle Root

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

2.993 × 10⁹⁶(97-digit number)
29934726822745160770…26821637663208545279
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
2.993 × 10⁹⁶(97-digit number)
29934726822745160770…26821637663208545279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.986 × 10⁹⁶(97-digit number)
59869453645490321541…53643275326417090559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.197 × 10⁹⁷(98-digit number)
11973890729098064308…07286550652834181119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.394 × 10⁹⁷(98-digit number)
23947781458196128616…14573101305668362239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.789 × 10⁹⁷(98-digit number)
47895562916392257233…29146202611336724479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.579 × 10⁹⁷(98-digit number)
95791125832784514466…58292405222673448959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.915 × 10⁹⁸(99-digit number)
19158225166556902893…16584810445346897919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.831 × 10⁹⁸(99-digit number)
38316450333113805786…33169620890693795839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.663 × 10⁹⁸(99-digit number)
76632900666227611573…66339241781387591679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.532 × 10⁹⁹(100-digit number)
15326580133245522314…32678483562775183359
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,958,809 XPM·at block #6,839,315 · 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