Block #557,279

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/22/2014, 8:31:27 PM · Difficulty 10.9628 · 6,253,713 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a2b7bbd7ed7d4c355803ae0bcc4af489fd62d4ab1d8ba7e1ecb011e0b76ce82d

Height

#557,279

Difficulty

10.962798

Transactions

5

Size

1.23 KB

Version

2

Bits

0af679f3

Nonce

243,512,557

Timestamp

5/22/2014, 8:31:27 PM

Confirmations

6,253,713

Merkle Root

253a831f5879c804777e8a66c279588fc34079e91e3a733fb74354f002cc7fd8
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.

1.017 × 10⁹⁸(99-digit number)
10173400293402526000…00686659485535831951
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
1.017 × 10⁹⁸(99-digit number)
10173400293402526000…00686659485535831951
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.034 × 10⁹⁸(99-digit number)
20346800586805052001…01373318971071663901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.069 × 10⁹⁸(99-digit number)
40693601173610104002…02746637942143327801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.138 × 10⁹⁸(99-digit number)
81387202347220208005…05493275884286655601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.627 × 10⁹⁹(100-digit number)
16277440469444041601…10986551768573311201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.255 × 10⁹⁹(100-digit number)
32554880938888083202…21973103537146622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.510 × 10⁹⁹(100-digit number)
65109761877776166404…43946207074293244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.302 × 10¹⁰⁰(101-digit number)
13021952375555233280…87892414148586489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.604 × 10¹⁰⁰(101-digit number)
26043904751110466561…75784828297172979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.208 × 10¹⁰⁰(101-digit number)
52087809502220933123…51569656594345958401
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,732,040 XPM·at block #6,810,991 · 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