Block #459,667

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2014, 11:30:55 AM · Difficulty 10.4164 · 6,347,035 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
568bc56666e104330341cc93641eb3f281e49ed1824083fcff4fe82c4c013d2c

Height

#459,667

Difficulty

10.416353

Transactions

4

Size

1.52 KB

Version

2

Bits

0a6a961d

Nonce

27,572

Timestamp

3/25/2014, 11:30:55 AM

Confirmations

6,347,035

Merkle Root

d85a067628546bf6503d4ca227786a79013d8843f0479a998ca03d5426ae787c
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.637 × 10¹⁰⁰(101-digit number)
16375506712442234904…01169831606465346559
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.637 × 10¹⁰⁰(101-digit number)
16375506712442234904…01169831606465346559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.275 × 10¹⁰⁰(101-digit number)
32751013424884469808…02339663212930693119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.550 × 10¹⁰⁰(101-digit number)
65502026849768939617…04679326425861386239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.310 × 10¹⁰¹(102-digit number)
13100405369953787923…09358652851722772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.620 × 10¹⁰¹(102-digit number)
26200810739907575846…18717305703445544959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.240 × 10¹⁰¹(102-digit number)
52401621479815151693…37434611406891089919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.048 × 10¹⁰²(103-digit number)
10480324295963030338…74869222813782179839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.096 × 10¹⁰²(103-digit number)
20960648591926060677…49738445627564359679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.192 × 10¹⁰²(103-digit number)
41921297183852121355…99476891255128719359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.384 × 10¹⁰²(103-digit number)
83842594367704242710…98953782510257438719
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,697,713 XPM·at block #6,806,701 · 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