Block #430,400

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/5/2014, 11:43:54 AM · Difficulty 10.3424 · 6,375,938 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
00adde3bc712a718a85933a3397a3fdc88d90140106befb25e93619e47311fb6

Height

#430,400

Difficulty

10.342392

Transactions

9

Size

1.96 KB

Version

2

Bits

0a57a703

Nonce

293,143

Timestamp

3/5/2014, 11:43:54 AM

Confirmations

6,375,938

Merkle Root

3288df688a23eda86ef95bb52a6247487650b323999ab24d51af4071fe34c305
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.491 × 10⁹⁹(100-digit number)
34910803242916844206…59578077073178722879
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.491 × 10⁹⁹(100-digit number)
34910803242916844206…59578077073178722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.982 × 10⁹⁹(100-digit number)
69821606485833688413…19156154146357445759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.396 × 10¹⁰⁰(101-digit number)
13964321297166737682…38312308292714891519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.792 × 10¹⁰⁰(101-digit number)
27928642594333475365…76624616585429783039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.585 × 10¹⁰⁰(101-digit number)
55857285188666950730…53249233170859566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.117 × 10¹⁰¹(102-digit number)
11171457037733390146…06498466341719132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.234 × 10¹⁰¹(102-digit number)
22342914075466780292…12996932683438264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.468 × 10¹⁰¹(102-digit number)
44685828150933560584…25993865366876528639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.937 × 10¹⁰¹(102-digit number)
89371656301867121168…51987730733753057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.787 × 10¹⁰²(103-digit number)
17874331260373424233…03975461467506114559
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,694,788 XPM·at block #6,806,337 · 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