Block #463,644

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2014, 6:54:54 AM · Difficulty 10.4131 · 6,379,657 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1487f3ef73dff761568a40713d71e125c01d7c5536842e3ea111b312fc1af05c

Height

#463,644

Difficulty

10.413082

Transactions

1

Size

938 B

Version

2

Bits

0a69bfc1

Nonce

76,903

Timestamp

3/28/2014, 6:54:54 AM

Confirmations

6,379,657

Merkle Root

677eacef724daeba7e67644a318fc8f61abaf5bf7db98b08819be9e7771f8701
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.791 × 10¹⁰²(103-digit number)
17914384775861524900…21647055424500267921
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.791 × 10¹⁰²(103-digit number)
17914384775861524900…21647055424500267921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.582 × 10¹⁰²(103-digit number)
35828769551723049800…43294110849000535841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.165 × 10¹⁰²(103-digit number)
71657539103446099601…86588221698001071681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.433 × 10¹⁰³(104-digit number)
14331507820689219920…73176443396002143361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.866 × 10¹⁰³(104-digit number)
28663015641378439840…46352886792004286721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.732 × 10¹⁰³(104-digit number)
57326031282756879681…92705773584008573441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.146 × 10¹⁰⁴(105-digit number)
11465206256551375936…85411547168017146881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.293 × 10¹⁰⁴(105-digit number)
22930412513102751872…70823094336034293761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.586 × 10¹⁰⁴(105-digit number)
45860825026205503744…41646188672068587521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.172 × 10¹⁰⁴(105-digit number)
91721650052411007489…83292377344137175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.834 × 10¹⁰⁵(106-digit number)
18344330010482201497…66584754688274350081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,990,773 XPM·at block #6,843,300 · 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