Block #463,516

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2014, 4:46:12 AM · Difficulty 10.4131 · 6,346,747 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
185b6b9585d228e3721a256d9a95c5ad67192027eab1f7248d577683c502af8e

Height

#463,516

Difficulty

10.413061

Transactions

8

Size

2.85 KB

Version

2

Bits

0a69be64

Nonce

31,675

Timestamp

3/28/2014, 4:46:12 AM

Confirmations

6,346,747

Merkle Root

7419c44d27a0ebc83619502f83a89d0cae04adf7b0e13068dabbfc9c3347004e
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.751 × 10⁹⁴(95-digit number)
97519217078134124393…68901104955685162241
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.751 × 10⁹⁴(95-digit number)
97519217078134124393…68901104955685162241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.950 × 10⁹⁵(96-digit number)
19503843415626824878…37802209911370324481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.900 × 10⁹⁵(96-digit number)
39007686831253649757…75604419822740648961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.801 × 10⁹⁵(96-digit number)
78015373662507299514…51208839645481297921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.560 × 10⁹⁶(97-digit number)
15603074732501459902…02417679290962595841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.120 × 10⁹⁶(97-digit number)
31206149465002919805…04835358581925191681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.241 × 10⁹⁶(97-digit number)
62412298930005839611…09670717163850383361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.248 × 10⁹⁷(98-digit number)
12482459786001167922…19341434327700766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.496 × 10⁹⁷(98-digit number)
24964919572002335844…38682868655401533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.992 × 10⁹⁷(98-digit number)
49929839144004671689…77365737310803066881
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,726,177 XPM·at block #6,810,262 · 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