Block #2,557,917

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2018, 1:39:07 AM · Difficulty 10.9915 · 4,273,424 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4c3e7b5a55780db10cdf22f7e06ee467b747f2adbb92f2be1d1eae11fa9bfa7d

Height

#2,557,917

Difficulty

10.991501

Transactions

2

Size

1018 B

Version

2

Bits

0afdd305

Nonce

1,860,845,844

Timestamp

3/10/2018, 1:39:07 AM

Confirmations

4,273,424

Merkle Root

77e280122db354b6f1090c051892fa08ae9efd5c1c4c0b8ce36f7af97e509f24
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.

5.043 × 10⁹³(94-digit number)
50431179871187250882…89032521723525388159
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
5.043 × 10⁹³(94-digit number)
50431179871187250882…89032521723525388159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.008 × 10⁹⁴(95-digit number)
10086235974237450176…78065043447050776319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.017 × 10⁹⁴(95-digit number)
20172471948474900352…56130086894101552639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.034 × 10⁹⁴(95-digit number)
40344943896949800705…12260173788203105279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.068 × 10⁹⁴(95-digit number)
80689887793899601411…24520347576406210559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.613 × 10⁹⁵(96-digit number)
16137977558779920282…49040695152812421119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.227 × 10⁹⁵(96-digit number)
32275955117559840564…98081390305624842239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.455 × 10⁹⁵(96-digit number)
64551910235119681129…96162780611249684479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.291 × 10⁹⁶(97-digit number)
12910382047023936225…92325561222499368959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.582 × 10⁹⁶(97-digit number)
25820764094047872451…84651122444998737919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.164 × 10⁹⁶(97-digit number)
51641528188095744903…69302244889997475839
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,894,882 XPM·at block #6,831,340 · 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