Block #452,069

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 8:46:57 AM · Difficulty 10.3851 · 6,388,560 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f5ae0ff9f181b824b3cf478138d09ca7a1301e3b1428cc7952b0683433783345

Height

#452,069

Difficulty

10.385142

Transactions

2

Size

1.57 KB

Version

2

Bits

0a6298a5

Nonce

153,957

Timestamp

3/20/2014, 8:46:57 AM

Confirmations

6,388,560

Merkle Root

0734ba63581a435cdac7aba57e8981efd9dde1df814ecc129c2f43c08b2bd925
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.

8.343 × 10⁹⁴(95-digit number)
83435953158468640467…18607156510618526131
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
8.343 × 10⁹⁴(95-digit number)
83435953158468640467…18607156510618526131
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.668 × 10⁹⁵(96-digit number)
16687190631693728093…37214313021237052261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.337 × 10⁹⁵(96-digit number)
33374381263387456186…74428626042474104521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.674 × 10⁹⁵(96-digit number)
66748762526774912373…48857252084948209041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.334 × 10⁹⁶(97-digit number)
13349752505354982474…97714504169896418081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.669 × 10⁹⁶(97-digit number)
26699505010709964949…95429008339792836161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.339 × 10⁹⁶(97-digit number)
53399010021419929899…90858016679585672321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.067 × 10⁹⁷(98-digit number)
10679802004283985979…81716033359171344641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.135 × 10⁹⁷(98-digit number)
21359604008567971959…63432066718342689281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.271 × 10⁹⁷(98-digit number)
42719208017135943919…26864133436685378561
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,969,372 XPM·at block #6,840,628 · 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