Block #2,585,034

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2018, 2:42:04 PM · Difficulty 11.2392 · 4,258,582 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
072dd0e6608b8e7eec0d43b6d62bd4b9f7ec853463468912b62b8d4608bcdd90

Height

#2,585,034

Difficulty

11.239177

Transactions

8

Size

2.60 KB

Version

2

Bits

0b3d3abc

Nonce

329,132,234

Timestamp

3/25/2018, 2:42:04 PM

Confirmations

4,258,582

Merkle Root

dd4c1278c3e147cc3bb4842d1983b9bb60f87cfef9bdb18600132de9c8c4653e
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.508 × 10⁹³(94-digit number)
35081403457531459757…81620892245183313919
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.508 × 10⁹³(94-digit number)
35081403457531459757…81620892245183313919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.016 × 10⁹³(94-digit number)
70162806915062919515…63241784490366627839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.403 × 10⁹⁴(95-digit number)
14032561383012583903…26483568980733255679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.806 × 10⁹⁴(95-digit number)
28065122766025167806…52967137961466511359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.613 × 10⁹⁴(95-digit number)
56130245532050335612…05934275922933022719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.122 × 10⁹⁵(96-digit number)
11226049106410067122…11868551845866045439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.245 × 10⁹⁵(96-digit number)
22452098212820134244…23737103691732090879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.490 × 10⁹⁵(96-digit number)
44904196425640268489…47474207383464181759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.980 × 10⁹⁵(96-digit number)
89808392851280536979…94948414766928363519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.796 × 10⁹⁶(97-digit number)
17961678570256107395…89896829533856727039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.592 × 10⁹⁶(97-digit number)
35923357140512214791…79793659067713454079
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,993,292 XPM·at block #6,843,615 · 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