Block #549,559

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/17/2014, 3:20:50 PM · Difficulty 10.9610 · 6,257,062 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3a5b9fdcc83af35758418ad1f2dcf337c074bc024e5b54e55aea33e63cee3a89

Height

#549,559

Difficulty

10.960956

Transactions

10

Size

2.40 KB

Version

2

Bits

0af6013d

Nonce

188,253

Timestamp

5/17/2014, 3:20:50 PM

Confirmations

6,257,062

Merkle Root

7e9439909ecc94a2684a883231f2b84ecd6998e3b8a437d8386bd254bfa1074d
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.649 × 10⁹⁷(98-digit number)
16490739965149175449…16936664867429403961
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.649 × 10⁹⁷(98-digit number)
16490739965149175449…16936664867429403961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.298 × 10⁹⁷(98-digit number)
32981479930298350898…33873329734858807921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.596 × 10⁹⁷(98-digit number)
65962959860596701796…67746659469717615841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.319 × 10⁹⁸(99-digit number)
13192591972119340359…35493318939435231681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.638 × 10⁹⁸(99-digit number)
26385183944238680718…70986637878870463361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.277 × 10⁹⁸(99-digit number)
52770367888477361437…41973275757740926721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.055 × 10⁹⁹(100-digit number)
10554073577695472287…83946551515481853441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.110 × 10⁹⁹(100-digit number)
21108147155390944574…67893103030963706881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.221 × 10⁹⁹(100-digit number)
42216294310781889149…35786206061927413761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.443 × 10⁹⁹(100-digit number)
84432588621563778299…71572412123854827521
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,697,068 XPM·at block #6,806,620 · 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