Block #463,106

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/27/2014, 9:16:03 PM · Difficulty 10.4176 · 6,346,004 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c8dc01869b3e1cfb5c056e7b2f67e0fd687947a54116f84a24ef5350bcf2d3d

Height

#463,106

Difficulty

10.417585

Transactions

7

Size

1.84 KB

Version

2

Bits

0a6ae6d6

Nonce

32,127

Timestamp

3/27/2014, 9:16:03 PM

Confirmations

6,346,004

Merkle Root

6cdc4ab912e371b918aed1c74b83ee040d35bcff590e61886eaa74af4aff09de
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.182 × 10¹⁰⁴(105-digit number)
21821022719790647898…43663263257307251199
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.182 × 10¹⁰⁴(105-digit number)
21821022719790647898…43663263257307251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.364 × 10¹⁰⁴(105-digit number)
43642045439581295796…87326526514614502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.728 × 10¹⁰⁴(105-digit number)
87284090879162591592…74653053029229004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.745 × 10¹⁰⁵(106-digit number)
17456818175832518318…49306106058458009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.491 × 10¹⁰⁵(106-digit number)
34913636351665036637…98612212116916019199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.982 × 10¹⁰⁵(106-digit number)
69827272703330073274…97224424233832038399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.396 × 10¹⁰⁶(107-digit number)
13965454540666014654…94448848467664076799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.793 × 10¹⁰⁶(107-digit number)
27930909081332029309…88897696935328153599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.586 × 10¹⁰⁶(107-digit number)
55861818162664058619…77795393870656307199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.117 × 10¹⁰⁷(108-digit number)
11172363632532811723…55590787741312614399
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,716,936 XPM·at block #6,809,109 · 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