Block #473,654

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/4/2014, 1:39:48 AM · Difficulty 10.4462 · 6,353,257 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd4b791855ba8e3080be0c48f1c3923a381947687febcee66334ee1aeff45895

Height

#473,654

Difficulty

10.446220

Transactions

4

Size

1.51 KB

Version

2

Bits

0a723b74

Nonce

7,670

Timestamp

4/4/2014, 1:39:48 AM

Confirmations

6,353,257

Merkle Root

88271474ce5fed794bcefeb4ad0eac6241c73cf2544edcea574ac587105a6a30
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.

3.990 × 10⁹⁴(95-digit number)
39903832953117264607…58225889486628230401
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
3.990 × 10⁹⁴(95-digit number)
39903832953117264607…58225889486628230401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.980 × 10⁹⁴(95-digit number)
79807665906234529214…16451778973256460801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.596 × 10⁹⁵(96-digit number)
15961533181246905842…32903557946512921601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.192 × 10⁹⁵(96-digit number)
31923066362493811685…65807115893025843201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.384 × 10⁹⁵(96-digit number)
63846132724987623371…31614231786051686401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.276 × 10⁹⁶(97-digit number)
12769226544997524674…63228463572103372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.553 × 10⁹⁶(97-digit number)
25538453089995049348…26456927144206745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.107 × 10⁹⁶(97-digit number)
51076906179990098697…52913854288413491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.021 × 10⁹⁷(98-digit number)
10215381235998019739…05827708576826982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.043 × 10⁹⁷(98-digit number)
20430762471996039478…11655417153653964801
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,859,457 XPM·at block #6,826,910 · 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