Block #460,245

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/25/2014, 8:57:36 PM · Difficulty 10.4196 · 6,353,767 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cae44df13377ad849a605e656591ae2d3724d073c89fc4d5de7b14ceedb71d55

Height

#460,245

Difficulty

10.419625

Transactions

4

Size

48.65 KB

Version

2

Bits

0a6b6c8f

Nonce

19,244

Timestamp

3/25/2014, 8:57:36 PM

Confirmations

6,353,767

Merkle Root

582e4030061ca40dd4ab3f5cc5856c9b419ce9f73b2ff95ce873aca3ba33d9b3
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.050 × 10¹⁰³(104-digit number)
40506667805362654035…49955562373536064001
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.050 × 10¹⁰³(104-digit number)
40506667805362654035…49955562373536064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.101 × 10¹⁰³(104-digit number)
81013335610725308070…99911124747072128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.620 × 10¹⁰⁴(105-digit number)
16202667122145061614…99822249494144256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.240 × 10¹⁰⁴(105-digit number)
32405334244290123228…99644498988288512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.481 × 10¹⁰⁴(105-digit number)
64810668488580246456…99288997976577024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.296 × 10¹⁰⁵(106-digit number)
12962133697716049291…98577995953154048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.592 × 10¹⁰⁵(106-digit number)
25924267395432098582…97155991906308096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.184 × 10¹⁰⁵(106-digit number)
51848534790864197165…94311983812616192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.036 × 10¹⁰⁶(107-digit number)
10369706958172839433…88623967625232384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.073 × 10¹⁰⁶(107-digit number)
20739413916345678866…77247935250464768001
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,756,179 XPM·at block #6,814,011 · 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