Block #465,354

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/29/2014, 9:32:52 AM · Difficulty 10.4272 · 6,359,420 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11ffc9cceb4808434eeaeb012349374ac44f6c38333d1daa93d46d2db37dcbba

Height

#465,354

Difficulty

10.427166

Transactions

2

Size

698 B

Version

2

Bits

0a6d5abd

Nonce

65,301

Timestamp

3/29/2014, 9:32:52 AM

Confirmations

6,359,420

Merkle Root

d3567e05dd827253dc357f28fb1c3255edf341534095a452a2df008ad646e2d8
Transactions (2)
1 in → 1 out9.1900 XPM116 B
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.

9.318 × 10¹⁰²(103-digit number)
93185363029627023988…62135051080164198401
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
9.318 × 10¹⁰²(103-digit number)
93185363029627023988…62135051080164198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.863 × 10¹⁰³(104-digit number)
18637072605925404797…24270102160328396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.727 × 10¹⁰³(104-digit number)
37274145211850809595…48540204320656793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.454 × 10¹⁰³(104-digit number)
74548290423701619190…97080408641313587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.490 × 10¹⁰⁴(105-digit number)
14909658084740323838…94160817282627174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.981 × 10¹⁰⁴(105-digit number)
29819316169480647676…88321634565254348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.963 × 10¹⁰⁴(105-digit number)
59638632338961295352…76643269130508697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.192 × 10¹⁰⁵(106-digit number)
11927726467792259070…53286538261017395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.385 × 10¹⁰⁵(106-digit number)
23855452935584518141…06573076522034790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.771 × 10¹⁰⁵(106-digit number)
47710905871169036282…13146153044069580801
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,842,264 XPM·at block #6,824,773 · 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