Block #468,737

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2014, 5:11:34 PM · Difficulty 10.4332 · 6,340,826 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c7fa198319ff4e1808e5014f8740866205454e0169eacf3ad5c3c54533d0814a

Height

#468,737

Difficulty

10.433220

Transactions

1

Size

902 B

Version

2

Bits

0a6ee784

Nonce

340,533

Timestamp

3/31/2014, 5:11:34 PM

Confirmations

6,340,826

Merkle Root

df8f36a89a7a1e556ff41b3eee4e3e8340c96578e1c97f19a42d7b2febe53c8d
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.

1.965 × 10⁹⁸(99-digit number)
19659921893481748495…56588195316170129921
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
1.965 × 10⁹⁸(99-digit number)
19659921893481748495…56588195316170129921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.931 × 10⁹⁸(99-digit number)
39319843786963496990…13176390632340259841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.863 × 10⁹⁸(99-digit number)
78639687573926993981…26352781264680519681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.572 × 10⁹⁹(100-digit number)
15727937514785398796…52705562529361039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.145 × 10⁹⁹(100-digit number)
31455875029570797592…05411125058722078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.291 × 10⁹⁹(100-digit number)
62911750059141595185…10822250117444157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.258 × 10¹⁰⁰(101-digit number)
12582350011828319037…21644500234888314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.516 × 10¹⁰⁰(101-digit number)
25164700023656638074…43289000469776629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.032 × 10¹⁰⁰(101-digit number)
50329400047313276148…86578000939553259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.006 × 10¹⁰¹(102-digit number)
10065880009462655229…73156001879106519041
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,720,579 XPM·at block #6,809,562 · 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.

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