Block #469,005

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2014, 9:51:04 PM · Difficulty 10.4319 · 6,345,253 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8b359ac8f7aee5b15771c75154f5ea8229035fadb9c57e53de62379db1694a30

Height

#469,005

Difficulty

10.431895

Transactions

2

Size

2.48 KB

Version

2

Bits

0a6e90a8

Nonce

64,183

Timestamp

3/31/2014, 9:51:04 PM

Confirmations

6,345,253

Merkle Root

585508a0ef063673bd66c389a6778bdce861d14b6e54b17ce8d4d1966dc3559c
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.

2.110 × 10⁹⁴(95-digit number)
21109514542815585316…38716228302174060801
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
2.110 × 10⁹⁴(95-digit number)
21109514542815585316…38716228302174060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.221 × 10⁹⁴(95-digit number)
42219029085631170632…77432456604348121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.443 × 10⁹⁴(95-digit number)
84438058171262341264…54864913208696243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.688 × 10⁹⁵(96-digit number)
16887611634252468252…09729826417392486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.377 × 10⁹⁵(96-digit number)
33775223268504936505…19459652834784972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.755 × 10⁹⁵(96-digit number)
67550446537009873011…38919305669569945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.351 × 10⁹⁶(97-digit number)
13510089307401974602…77838611339139891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.702 × 10⁹⁶(97-digit number)
27020178614803949204…55677222678279782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.404 × 10⁹⁶(97-digit number)
54040357229607898409…11354445356559564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.080 × 10⁹⁷(98-digit number)
10808071445921579681…22708890713119129601
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,758,131 XPM·at block #6,814,257 · 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