Block #476,569

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/5/2014, 10:14:34 PM · Difficulty 10.4731 · 6,340,598 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
74d4e5df1cca361ba093562e56df821b9e06d14fbc247316a206bc9fed6c6017

Height

#476,569

Difficulty

10.473096

Transactions

5

Size

2.41 KB

Version

2

Bits

0a791cd2

Nonce

208,923

Timestamp

4/5/2014, 10:14:34 PM

Confirmations

6,340,598

Merkle Root

bd4f066a1eabcb95e6746bbe5a1e68dd2f9e96936b6ad81d80cbb74e01a0dded
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.647 × 10⁹⁸(99-digit number)
26477471740463740116…06618243705010461439
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.647 × 10⁹⁸(99-digit number)
26477471740463740116…06618243705010461439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.295 × 10⁹⁸(99-digit number)
52954943480927480233…13236487410020922879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.059 × 10⁹⁹(100-digit number)
10590988696185496046…26472974820041845759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.118 × 10⁹⁹(100-digit number)
21181977392370992093…52945949640083691519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.236 × 10⁹⁹(100-digit number)
42363954784741984186…05891899280167383039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.472 × 10⁹⁹(100-digit number)
84727909569483968372…11783798560334766079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.694 × 10¹⁰⁰(101-digit number)
16945581913896793674…23567597120669532159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.389 × 10¹⁰⁰(101-digit number)
33891163827793587349…47135194241339064319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.778 × 10¹⁰⁰(101-digit number)
67782327655587174698…94270388482678128639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.355 × 10¹⁰¹(102-digit number)
13556465531117434939…88540776965356257279
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,781,370 XPM·at block #6,817,166 · 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