Block #434,582

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 8:53:26 AM · Difficulty 10.3487 · 6,392,211 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ae66e602df04f20b59fd105672e0dcc48d1784a93e036f4c9746ba17a250c26f

Height

#434,582

Difficulty

10.348680

Transactions

2

Size

1.07 KB

Version

2

Bits

0a594314

Nonce

8,070

Timestamp

3/8/2014, 8:53:26 AM

Confirmations

6,392,211

Merkle Root

598694c03b1f4a654076f27cb1bd9bff481959c6b18a4e69c5c4c9d697eba54c
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.

2.549 × 10⁹³(94-digit number)
25490639010240584136…25249201843355667199
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
2.549 × 10⁹³(94-digit number)
25490639010240584136…25249201843355667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.098 × 10⁹³(94-digit number)
50981278020481168272…50498403686711334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.019 × 10⁹⁴(95-digit number)
10196255604096233654…00996807373422668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.039 × 10⁹⁴(95-digit number)
20392511208192467308…01993614746845337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.078 × 10⁹⁴(95-digit number)
40785022416384934617…03987229493690675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.157 × 10⁹⁴(95-digit number)
81570044832769869235…07974458987381350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.631 × 10⁹⁵(96-digit number)
16314008966553973847…15948917974762700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.262 × 10⁹⁵(96-digit number)
32628017933107947694…31897835949525401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.525 × 10⁹⁵(96-digit number)
65256035866215895388…63795671899050803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.305 × 10⁹⁶(97-digit number)
13051207173243179077…27591343798101606399
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,858,506 XPM·at block #6,826,792 · 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