Block #482,088

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2014, 7:08:06 AM · Difficulty 10.5400 · 6,354,832 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
52c0e8a79ee35816ad6d4e6d3f8a88f35ac9cefdd25df5cd40feecd89035d833

Height

#482,088

Difficulty

10.539950

Transactions

1

Size

208 B

Version

2

Bits

0a8a3a2c

Nonce

372,833,195

Timestamp

4/9/2014, 7:08:06 AM

Confirmations

6,354,832

Merkle Root

323474ac0005bd1e09a6b1e60858e663deaf7d6cbba9afbf456346b4f0b2b290
Transactions (1)
1 in → 1 out8.9900 XPM116 B
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.

5.241 × 10⁹⁹(100-digit number)
52415024668934176544…43590122388592959999
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
5.241 × 10⁹⁹(100-digit number)
52415024668934176544…43590122388592959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.048 × 10¹⁰⁰(101-digit number)
10483004933786835308…87180244777185919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.096 × 10¹⁰⁰(101-digit number)
20966009867573670617…74360489554371839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.193 × 10¹⁰⁰(101-digit number)
41932019735147341235…48720979108743679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.386 × 10¹⁰⁰(101-digit number)
83864039470294682471…97441958217487359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.677 × 10¹⁰¹(102-digit number)
16772807894058936494…94883916434974719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.354 × 10¹⁰¹(102-digit number)
33545615788117872988…89767832869949439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.709 × 10¹⁰¹(102-digit number)
67091231576235745976…79535665739898879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.341 × 10¹⁰²(103-digit number)
13418246315247149195…59071331479797759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.683 × 10¹⁰²(103-digit number)
26836492630494298390…18142662959595519999
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,939,655 XPM·at block #6,836,919 · 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.
Privacy Policy·

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