Block #471,034

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/2/2014, 7:54:08 AM · Difficulty 10.4318 · 6,336,331 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3c7ecd50defc3048a5e8d2152010c3273670655d955bd7106f23c1c5eeec7a1c

Height

#471,034

Difficulty

10.431766

Transactions

8

Size

2.00 KB

Version

2

Bits

0a6e883c

Nonce

66,993

Timestamp

4/2/2014, 7:54:08 AM

Confirmations

6,336,331

Merkle Root

5a0e08b8a956611b77ab2f6d06bd3cf49fee837f7a7ae6fd15b4a680cd90a09b
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.

1.700 × 10⁹⁸(99-digit number)
17000704302560702198…01698293668914191999
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
1.700 × 10⁹⁸(99-digit number)
17000704302560702198…01698293668914191999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.400 × 10⁹⁸(99-digit number)
34001408605121404397…03396587337828383999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.800 × 10⁹⁸(99-digit number)
68002817210242808795…06793174675656767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.360 × 10⁹⁹(100-digit number)
13600563442048561759…13586349351313535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.720 × 10⁹⁹(100-digit number)
27201126884097123518…27172698702627071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.440 × 10⁹⁹(100-digit number)
54402253768194247036…54345397405254143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.088 × 10¹⁰⁰(101-digit number)
10880450753638849407…08690794810508287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.176 × 10¹⁰⁰(101-digit number)
21760901507277698814…17381589621016575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.352 × 10¹⁰⁰(101-digit number)
43521803014555397629…34763179242033151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.704 × 10¹⁰⁰(101-digit number)
87043606029110795258…69526358484066303999
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,702,943 XPM·at block #6,807,364 · 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