Block #558,200

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2014, 10:23:48 AM · Difficulty 10.9635 · 6,248,882 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
149b6faada1ff58765ae133d09c2eed8f38c302a876b6a409d935247d4d735b0

Height

#558,200

Difficulty

10.963482

Transactions

4

Size

5.20 KB

Version

2

Bits

0af6a6be

Nonce

133,992

Timestamp

5/23/2014, 10:23:48 AM

Confirmations

6,248,882

Merkle Root

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

7.755 × 10¹⁰²(103-digit number)
77557362668122488080…13952412949780026881
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
7.755 × 10¹⁰²(103-digit number)
77557362668122488080…13952412949780026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.551 × 10¹⁰³(104-digit number)
15511472533624497616…27904825899560053761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.102 × 10¹⁰³(104-digit number)
31022945067248995232…55809651799120107521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.204 × 10¹⁰³(104-digit number)
62045890134497990464…11619303598240215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.240 × 10¹⁰⁴(105-digit number)
12409178026899598092…23238607196480430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.481 × 10¹⁰⁴(105-digit number)
24818356053799196185…46477214392960860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.963 × 10¹⁰⁴(105-digit number)
49636712107598392371…92954428785921720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.927 × 10¹⁰⁴(105-digit number)
99273424215196784743…85908857571843440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.985 × 10¹⁰⁵(106-digit number)
19854684843039356948…71817715143686881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.970 × 10¹⁰⁵(106-digit number)
39709369686078713897…43635430287373762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.941 × 10¹⁰⁵(106-digit number)
79418739372157427794…87270860574747525121
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 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
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,700,753 XPM·at block #6,807,081 · 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.

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