Block #457,124

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 4:34:50 PM · Difficulty 10.4203 · 6,370,083 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
37fe6cff6f3de94991f15529b9f266ad6df2403546b984fd2a8a0db950c5f817

Height

#457,124

Difficulty

10.420349

Transactions

5

Size

2.50 KB

Version

2

Bits

0a6b9bff

Nonce

866

Timestamp

3/23/2014, 4:34:50 PM

Confirmations

6,370,083

Merkle Root

7227f8c7900c6cd6325165dac5bdd96866f3ff7fce26fc17f0970a7bfa35612e
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.613 × 10¹⁰⁴(105-digit number)
36135464135341203230…10863254961766707201
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.613 × 10¹⁰⁴(105-digit number)
36135464135341203230…10863254961766707201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.227 × 10¹⁰⁴(105-digit number)
72270928270682406461…21726509923533414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.445 × 10¹⁰⁵(106-digit number)
14454185654136481292…43453019847066828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.890 × 10¹⁰⁵(106-digit number)
28908371308272962584…86906039694133657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.781 × 10¹⁰⁵(106-digit number)
57816742616545925169…73812079388267315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.156 × 10¹⁰⁶(107-digit number)
11563348523309185033…47624158776534630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.312 × 10¹⁰⁶(107-digit number)
23126697046618370067…95248317553069260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.625 × 10¹⁰⁶(107-digit number)
46253394093236740135…90496635106138521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.250 × 10¹⁰⁶(107-digit number)
92506788186473480271…80993270212277043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.850 × 10¹⁰⁷(108-digit number)
18501357637294696054…61986540424554086401
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,861,754 XPM·at block #6,827,206 · 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