Block #451,379

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2014, 9:42:23 PM · Difficulty 10.3816 · 6,357,792 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
22faf88249335945a40192d5bf3d6946c3042f5c5366853724f7dc3c1f3bbdf2

Height

#451,379

Difficulty

10.381595

Transactions

6

Size

1.31 KB

Version

2

Bits

0a61b031

Nonce

3,400

Timestamp

3/19/2014, 9:42:23 PM

Confirmations

6,357,792

Merkle Root

f32c67b4398a2029cb2f06ddd540b46c5d79cfd66acb8bd9f630b390a4241c39
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.

5.742 × 10⁹⁹(100-digit number)
57422416438325053962…69134464347004458239
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
5.742 × 10⁹⁹(100-digit number)
57422416438325053962…69134464347004458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.148 × 10¹⁰⁰(101-digit number)
11484483287665010792…38268928694008916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.296 × 10¹⁰⁰(101-digit number)
22968966575330021585…76537857388017832959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.593 × 10¹⁰⁰(101-digit number)
45937933150660043170…53075714776035665919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.187 × 10¹⁰⁰(101-digit number)
91875866301320086340…06151429552071331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.837 × 10¹⁰¹(102-digit number)
18375173260264017268…12302859104142663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.675 × 10¹⁰¹(102-digit number)
36750346520528034536…24605718208285327359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.350 × 10¹⁰¹(102-digit number)
73500693041056069072…49211436416570654719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.470 × 10¹⁰²(103-digit number)
14700138608211213814…98422872833141309439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.940 × 10¹⁰²(103-digit number)
29400277216422427628…96845745666282618879
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,717,431 XPM·at block #6,809,170 · 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