Block #518,281

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2014, 12:03:26 PM · Difficulty 10.8532 · 6,292,542 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
33afaa92397aa1b4ed9ea214efc7be15bb7e13861d8b275e714864ed5dada6b6

Height

#518,281

Difficulty

10.853207

Transactions

3

Size

662 B

Version

2

Bits

0ada6bc4

Nonce

46,041,009

Timestamp

4/30/2014, 12:03:26 PM

Confirmations

6,292,542

Merkle Root

35ed4217df354f9616e5defafd96b260991046161a50112e9aeb5d16d4f8a692
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.513 × 10¹⁰⁰(101-digit number)
45130652237542583764…06592780005580866561
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.513 × 10¹⁰⁰(101-digit number)
45130652237542583764…06592780005580866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.026 × 10¹⁰⁰(101-digit number)
90261304475085167528…13185560011161733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.805 × 10¹⁰¹(102-digit number)
18052260895017033505…26371120022323466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.610 × 10¹⁰¹(102-digit number)
36104521790034067011…52742240044646932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.220 × 10¹⁰¹(102-digit number)
72209043580068134022…05484480089293864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.444 × 10¹⁰²(103-digit number)
14441808716013626804…10968960178587729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.888 × 10¹⁰²(103-digit number)
28883617432027253609…21937920357175459841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.776 × 10¹⁰²(103-digit number)
57767234864054507218…43875840714350919681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.155 × 10¹⁰³(104-digit number)
11553446972810901443…87751681428701839361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.310 × 10¹⁰³(104-digit number)
23106893945621802887…75503362857403678721
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,730,685 XPM·at block #6,810,822 · 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