Block #473,079

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/3/2014, 4:05:31 PM · Difficulty 10.4453 · 6,353,571 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ec81773d52a771b0574b4bf2ccdbce10d1452408c5cd0e6957e1ba78e29f2e9

Height

#473,079

Difficulty

10.445278

Transactions

2

Size

1.53 KB

Version

2

Bits

0a71fdb8

Nonce

88,298

Timestamp

4/3/2014, 4:05:31 PM

Confirmations

6,353,571

Merkle Root

81f4d071e0bf13b2a05d718c1d6e7c93bf4b4e9178ac120b67939a59ee4b9f68
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.032 × 10⁹⁵(96-digit number)
10328272568982867988…48522204027568885991
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.032 × 10⁹⁵(96-digit number)
10328272568982867988…48522204027568885991
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.065 × 10⁹⁵(96-digit number)
20656545137965735976…97044408055137771981
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.131 × 10⁹⁵(96-digit number)
41313090275931471953…94088816110275543961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.262 × 10⁹⁵(96-digit number)
82626180551862943906…88177632220551087921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.652 × 10⁹⁶(97-digit number)
16525236110372588781…76355264441102175841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.305 × 10⁹⁶(97-digit number)
33050472220745177562…52710528882204351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.610 × 10⁹⁶(97-digit number)
66100944441490355125…05421057764408703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.322 × 10⁹⁷(98-digit number)
13220188888298071025…10842115528817406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.644 × 10⁹⁷(98-digit number)
26440377776596142050…21684231057634813441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.288 × 10⁹⁷(98-digit number)
52880755553192284100…43368462115269626881
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,857,349 XPM·at block #6,826,649 · 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