Block #459,631

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2014, 11:02:47 AM · Difficulty 10.4173 · 6,350,997 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
929f9107b8bd927753a3ae287f2060de1d9a7136106c922afc5a9e242b3f41e1

Height

#459,631

Difficulty

10.417279

Transactions

3

Size

659 B

Version

2

Bits

0a6ad2c6

Nonce

2,061

Timestamp

3/25/2014, 11:02:47 AM

Confirmations

6,350,997

Merkle Root

9c8e358c43ad998e4adc214decd41b92d12c50b87141df3dec6da8f3cf7dbb84
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.

2.336 × 10¹⁰⁰(101-digit number)
23363193011102608484…03720555715477247999
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
2.336 × 10¹⁰⁰(101-digit number)
23363193011102608484…03720555715477247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.672 × 10¹⁰⁰(101-digit number)
46726386022205216968…07441111430954495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.345 × 10¹⁰⁰(101-digit number)
93452772044410433937…14882222861908991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.869 × 10¹⁰¹(102-digit number)
18690554408882086787…29764445723817983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.738 × 10¹⁰¹(102-digit number)
37381108817764173574…59528891447635967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.476 × 10¹⁰¹(102-digit number)
74762217635528347149…19057782895271935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.495 × 10¹⁰²(103-digit number)
14952443527105669429…38115565790543871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.990 × 10¹⁰²(103-digit number)
29904887054211338859…76231131581087743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.980 × 10¹⁰²(103-digit number)
59809774108422677719…52462263162175487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.196 × 10¹⁰³(104-digit number)
11961954821684535543…04924526324350975999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,729,110 XPM·at block #6,810,627 · 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