Block #463,421

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/28/2014, 3:00:50 AM · Difficulty 10.4145 · 6,349,268 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f535604729d5ea595c3a90af77cdf70c26e2d317b5c15a08586f3ff37e69a18

Height

#463,421

Difficulty

10.414469

Transactions

7

Size

1.95 KB

Version

2

Bits

0a6a1a9d

Nonce

152,978

Timestamp

3/28/2014, 3:00:50 AM

Confirmations

6,349,268

Merkle Root

63d103216e0092ea0f76f3ab40d08353dd15a78f779c6fa6658945560e8ac364
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.

6.132 × 10⁹⁹(100-digit number)
61327360990421479785…82346452821136698369
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
6.132 × 10⁹⁹(100-digit number)
61327360990421479785…82346452821136698369
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.226 × 10¹⁰⁰(101-digit number)
12265472198084295957…64692905642273396739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.453 × 10¹⁰⁰(101-digit number)
24530944396168591914…29385811284546793479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.906 × 10¹⁰⁰(101-digit number)
49061888792337183828…58771622569093586959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.812 × 10¹⁰⁰(101-digit number)
98123777584674367657…17543245138187173919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.962 × 10¹⁰¹(102-digit number)
19624755516934873531…35086490276374347839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.924 × 10¹⁰¹(102-digit number)
39249511033869747062…70172980552748695679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.849 × 10¹⁰¹(102-digit number)
78499022067739494125…40345961105497391359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.569 × 10¹⁰²(103-digit number)
15699804413547898825…80691922210994782719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.139 × 10¹⁰²(103-digit number)
31399608827095797650…61383844421989565439
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,745,547 XPM·at block #6,812,688 · 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