Block #450,393

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2014, 6:39:06 AM · Difficulty 10.3710 · 6,363,436 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4bb1032c8cde3ccbd8817d57fd4d896bd868162818f7aa63e3850f81f7ef0cc6

Height

#450,393

Difficulty

10.370957

Transactions

2

Size

1.82 KB

Version

2

Bits

0a5ef70e

Nonce

130,438

Timestamp

3/19/2014, 6:39:06 AM

Confirmations

6,363,436

Merkle Root

784e3bb8c6ed85bb122ebb99ffc220a377ce1347dfc10edd261da65d24ecbf7e
Transactions (2)
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.458 × 10¹⁰⁵(106-digit number)
14589622475207136773…11492108720447979519
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.458 × 10¹⁰⁵(106-digit number)
14589622475207136773…11492108720447979519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.917 × 10¹⁰⁵(106-digit number)
29179244950414273547…22984217440895959039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.835 × 10¹⁰⁵(106-digit number)
58358489900828547095…45968434881791918079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.167 × 10¹⁰⁶(107-digit number)
11671697980165709419…91936869763583836159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.334 × 10¹⁰⁶(107-digit number)
23343395960331418838…83873739527167672319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.668 × 10¹⁰⁶(107-digit number)
46686791920662837676…67747479054335344639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.337 × 10¹⁰⁶(107-digit number)
93373583841325675352…35494958108670689279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.867 × 10¹⁰⁷(108-digit number)
18674716768265135070…70989916217341378559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.734 × 10¹⁰⁷(108-digit number)
37349433536530270141…41979832434682757119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.469 × 10¹⁰⁷(108-digit number)
74698867073060540282…83959664869365514239
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,754,701 XPM·at block #6,813,828 · 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