Block #434,858

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 1:00:44 PM · Difficulty 10.3524 · 6,407,228 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
17f91ea7c015252ce52ddcf734816ee5c6d92c4d4c70caa0f483113b97a227af

Height

#434,858

Difficulty

10.352389

Transactions

3

Size

659 B

Version

2

Bits

0a5a3630

Nonce

99,826

Timestamp

3/8/2014, 1:00:44 PM

Confirmations

6,407,228

Merkle Root

953b801a6bc41c9546d661c4e7cbbeb2a456b87ed959c93ada74d6869ed1a154
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.297 × 10⁹⁹(100-digit number)
12972166925285664479…18013180194776099999
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.297 × 10⁹⁹(100-digit number)
12972166925285664479…18013180194776099999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.594 × 10⁹⁹(100-digit number)
25944333850571328958…36026360389552199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.188 × 10⁹⁹(100-digit number)
51888667701142657916…72052720779104399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.037 × 10¹⁰⁰(101-digit number)
10377733540228531583…44105441558208799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.075 × 10¹⁰⁰(101-digit number)
20755467080457063166…88210883116417599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.151 × 10¹⁰⁰(101-digit number)
41510934160914126332…76421766232835199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.302 × 10¹⁰⁰(101-digit number)
83021868321828252665…52843532465670399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.660 × 10¹⁰¹(102-digit number)
16604373664365650533…05687064931340799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.320 × 10¹⁰¹(102-digit number)
33208747328731301066…11374129862681599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.641 × 10¹⁰¹(102-digit number)
66417494657462602132…22748259725363199999
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,981,073 XPM·at block #6,842,085 · 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