Block #548,071

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2014, 7:55:32 PM · Difficulty 10.9583 · 6,278,751 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e526bded9623924b80239b45d9854a34e5f44d03dbe3ca832f853d396206f866

Height

#548,071

Difficulty

10.958332

Transactions

2

Size

428 B

Version

2

Bits

0af55544

Nonce

18,722

Timestamp

5/16/2014, 7:55:32 PM

Confirmations

6,278,751

Merkle Root

f2d9b6956c642ac546ad9255dbf76540f64801c17c5483e3f74047b1d3493ebe
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.212 × 10¹⁰⁰(101-digit number)
12125209262381939592…56083607372326044161
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.212 × 10¹⁰⁰(101-digit number)
12125209262381939592…56083607372326044161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.425 × 10¹⁰⁰(101-digit number)
24250418524763879185…12167214744652088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.850 × 10¹⁰⁰(101-digit number)
48500837049527758371…24334429489304176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.700 × 10¹⁰⁰(101-digit number)
97001674099055516742…48668858978608353281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.940 × 10¹⁰¹(102-digit number)
19400334819811103348…97337717957216706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.880 × 10¹⁰¹(102-digit number)
38800669639622206696…94675435914433413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.760 × 10¹⁰¹(102-digit number)
77601339279244413393…89350871828866826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.552 × 10¹⁰²(103-digit number)
15520267855848882678…78701743657733652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.104 × 10¹⁰²(103-digit number)
31040535711697765357…57403487315467304961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.208 × 10¹⁰²(103-digit number)
62081071423395530715…14806974630934609921
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,858,740 XPM·at block #6,826,821 · 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