Block #470,158

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/1/2014, 5:17:41 PM · Difficulty 10.4320 · 6,345,989 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bdd41c10f454566ec37614a649674a6fdc44a0ea5a9441d883a71057524a9c29

Height

#470,158

Difficulty

10.431998

Transactions

5

Size

1.62 KB

Version

2

Bits

0a6e976b

Nonce

54,619

Timestamp

4/1/2014, 5:17:41 PM

Confirmations

6,345,989

Merkle Root

8ce9becd15bf639a2a1a9abdc66c41d06fedc8e4551036842d68c6002d86e4fc
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.

3.412 × 10¹⁰⁴(105-digit number)
34129462487946636435…20065705672348856319
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
3.412 × 10¹⁰⁴(105-digit number)
34129462487946636435…20065705672348856319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.825 × 10¹⁰⁴(105-digit number)
68258924975893272871…40131411344697712639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.365 × 10¹⁰⁵(106-digit number)
13651784995178654574…80262822689395425279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.730 × 10¹⁰⁵(106-digit number)
27303569990357309148…60525645378790850559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.460 × 10¹⁰⁵(106-digit number)
54607139980714618297…21051290757581701119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.092 × 10¹⁰⁶(107-digit number)
10921427996142923659…42102581515163402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.184 × 10¹⁰⁶(107-digit number)
21842855992285847318…84205163030326804479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.368 × 10¹⁰⁶(107-digit number)
43685711984571694637…68410326060653608959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.737 × 10¹⁰⁶(107-digit number)
87371423969143389275…36820652121307217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.747 × 10¹⁰⁷(108-digit number)
17474284793828677855…73641304242614435839
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,773,297 XPM·at block #6,816,146 · 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