Block #474,856

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 8:21:52 PM · Difficulty 10.4556 · 6,334,485 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e32eb083a5f210d5f7d75f8f7467a46ee46077e3685a68f3bf7e0cf7aae7de04

Height

#474,856

Difficulty

10.455553

Transactions

9

Size

1.97 KB

Version

2

Bits

0a749f27

Nonce

140,045

Timestamp

4/4/2014, 8:21:52 PM

Confirmations

6,334,485

Merkle Root

db49c6649a2eb46de87424d6eada69173da8cecd3ab71145ecfb0f11dad23fe8
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.

4.845 × 10¹⁰⁰(101-digit number)
48452592485417113531…23438398175528143039
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
4.845 × 10¹⁰⁰(101-digit number)
48452592485417113531…23438398175528143039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.690 × 10¹⁰⁰(101-digit number)
96905184970834227062…46876796351056286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.938 × 10¹⁰¹(102-digit number)
19381036994166845412…93753592702112572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.876 × 10¹⁰¹(102-digit number)
38762073988333690825…87507185404225144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.752 × 10¹⁰¹(102-digit number)
77524147976667381650…75014370808450288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.550 × 10¹⁰²(103-digit number)
15504829595333476330…50028741616900577279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.100 × 10¹⁰²(103-digit number)
31009659190666952660…00057483233801154559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.201 × 10¹⁰²(103-digit number)
62019318381333905320…00114966467602309119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.240 × 10¹⁰³(104-digit number)
12403863676266781064…00229932935204618239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.480 × 10¹⁰³(104-digit number)
24807727352533562128…00459865870409236479
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,718,793 XPM·at block #6,809,340 · 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