Block #550,876

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/18/2014, 10:59:01 AM · Difficulty 10.9621 · 6,259,039 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
785a84f3f5acf6096ad408452b3b419adeee093fb3f96901e3c9326fd135e1cb

Height

#550,876

Difficulty

10.962065

Transactions

5

Size

1.23 KB

Version

2

Bits

0af649e5

Nonce

66,982,497

Timestamp

5/18/2014, 10:59:01 AM

Confirmations

6,259,039

Merkle Root

89ec8ca26b307230045e90e365642b4822fbb0c26c83f812ae4d855263c7e5af
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.

4.154 × 10⁹⁹(100-digit number)
41545463413757064210…12132240653248048641
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
4.154 × 10⁹⁹(100-digit number)
41545463413757064210…12132240653248048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.309 × 10⁹⁹(100-digit number)
83090926827514128420…24264481306496097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.661 × 10¹⁰⁰(101-digit number)
16618185365502825684…48528962612992194561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.323 × 10¹⁰⁰(101-digit number)
33236370731005651368…97057925225984389121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.647 × 10¹⁰⁰(101-digit number)
66472741462011302736…94115850451968778241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.329 × 10¹⁰¹(102-digit number)
13294548292402260547…88231700903937556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.658 × 10¹⁰¹(102-digit number)
26589096584804521094…76463401807875112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.317 × 10¹⁰¹(102-digit number)
53178193169609042188…52926803615750225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.063 × 10¹⁰²(103-digit number)
10635638633921808437…05853607231500451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.127 × 10¹⁰²(103-digit number)
21271277267843616875…11707214463000903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.254 × 10¹⁰²(103-digit number)
42542554535687233751…23414428926001807361
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,723,404 XPM·at block #6,809,914 · 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