Block #2,557,829

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2018, 12:15:04 AM · Difficulty 10.9915 · 4,273,758 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e972b46eb97868ab24971ed05bb6be324136ce84f25051ca820965448b09c58

Height

#2,557,829

Difficulty

10.991493

Transactions

2

Size

425 B

Version

2

Bits

0afdd274

Nonce

346,971,608

Timestamp

3/10/2018, 12:15:04 AM

Confirmations

4,273,758

Merkle Root

1d5462228f968f67a212ad66876ea90e02d6af30c07b085a66bdacdf76d84600
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.

3.875 × 10⁹⁶(97-digit number)
38759507340295224832…21547024179099238401
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.875 × 10⁹⁶(97-digit number)
38759507340295224832…21547024179099238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.751 × 10⁹⁶(97-digit number)
77519014680590449664…43094048358198476801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.550 × 10⁹⁷(98-digit number)
15503802936118089932…86188096716396953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.100 × 10⁹⁷(98-digit number)
31007605872236179865…72376193432793907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.201 × 10⁹⁷(98-digit number)
62015211744472359731…44752386865587814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.240 × 10⁹⁸(99-digit number)
12403042348894471946…89504773731175628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.480 × 10⁹⁸(99-digit number)
24806084697788943892…79009547462351257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.961 × 10⁹⁸(99-digit number)
49612169395577887785…58019094924702515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.922 × 10⁹⁸(99-digit number)
99224338791155775570…16038189849405030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.984 × 10⁹⁹(100-digit number)
19844867758231155114…32076379698810060801
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,896,792 XPM·at block #6,831,586 · 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