Block #429,100

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2014, 1:26:47 PM · Difficulty 10.3462 · 6,383,920 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7cbd424c490f08aa045e6385a8d482f6ba71e5fe6730b667570dbc9d379c115b

Height

#429,100

Difficulty

10.346184

Transactions

7

Size

5.33 KB

Version

2

Bits

0a589f7e

Nonce

313,764

Timestamp

3/4/2014, 1:26:47 PM

Confirmations

6,383,920

Merkle Root

2f05dfe350c4f782c24706475d9518a56eaaf1c1b2ff6e5e4062fd57257c4449
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.065 × 10¹⁰¹(102-digit number)
10654758412561289554…40844622279418449919
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.065 × 10¹⁰¹(102-digit number)
10654758412561289554…40844622279418449919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.130 × 10¹⁰¹(102-digit number)
21309516825122579108…81689244558836899839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.261 × 10¹⁰¹(102-digit number)
42619033650245158216…63378489117673799679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.523 × 10¹⁰¹(102-digit number)
85238067300490316433…26756978235347599359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.704 × 10¹⁰²(103-digit number)
17047613460098063286…53513956470695198719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.409 × 10¹⁰²(103-digit number)
34095226920196126573…07027912941390397439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.819 × 10¹⁰²(103-digit number)
68190453840392253146…14055825882780794879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.363 × 10¹⁰³(104-digit number)
13638090768078450629…28111651765561589759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.727 × 10¹⁰³(104-digit number)
27276181536156901258…56223303531123179519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.455 × 10¹⁰³(104-digit number)
54552363072313802517…12446607062246359039
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,748,201 XPM·at block #6,813,019 · 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