Block #459,720

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/25/2014, 12:25:28 PM · Difficulty 10.4182 · 6,351,177 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b61768066652fbef9f1ef10870b32922b39179aa0254043803b09ad9a8824e51

Height

#459,720

Difficulty

10.418214

Transactions

2

Size

1.90 KB

Version

2

Bits

0a6b1016

Nonce

165,426

Timestamp

3/25/2014, 12:25:28 PM

Confirmations

6,351,177

Merkle Root

8820e12675e73c8f3a53b4a60c487ed8e0f3bf7f12e2f679981acafc0f4be6af
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.672 × 10⁹⁷(98-digit number)
16725049302735528323…84683807041365507441
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.672 × 10⁹⁷(98-digit number)
16725049302735528323…84683807041365507441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.345 × 10⁹⁷(98-digit number)
33450098605471056646…69367614082731014881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.690 × 10⁹⁷(98-digit number)
66900197210942113293…38735228165462029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.338 × 10⁹⁸(99-digit number)
13380039442188422658…77470456330924059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.676 × 10⁹⁸(99-digit number)
26760078884376845317…54940912661848119041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.352 × 10⁹⁸(99-digit number)
53520157768753690634…09881825323696238081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.070 × 10⁹⁹(100-digit number)
10704031553750738126…19763650647392476161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.140 × 10⁹⁹(100-digit number)
21408063107501476253…39527301294784952321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.281 × 10⁹⁹(100-digit number)
42816126215002952507…79054602589569904641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.563 × 10⁹⁹(100-digit number)
85632252430005905015…58109205179139809281
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,731,274 XPM·at block #6,810,896 · 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