Block #440,967

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/12/2014, 7:13:30 PM · Difficulty 10.3534 · 6,366,351 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
670a1d0e303981e48289f1f838aa266871824296d2eb7631892e2adeaa4bb32b

Height

#440,967

Difficulty

10.353361

Transactions

14

Size

3.91 KB

Version

2

Bits

0a5a75e5

Nonce

31,174

Timestamp

3/12/2014, 7:13:30 PM

Confirmations

6,366,351

Merkle Root

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

6.493 × 10⁹⁸(99-digit number)
64937450784207651825…14187151009979325439
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
6.493 × 10⁹⁸(99-digit number)
64937450784207651825…14187151009979325439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.298 × 10⁹⁹(100-digit number)
12987490156841530365…28374302019958650879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.597 × 10⁹⁹(100-digit number)
25974980313683060730…56748604039917301759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.194 × 10⁹⁹(100-digit number)
51949960627366121460…13497208079834603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.038 × 10¹⁰⁰(101-digit number)
10389992125473224292…26994416159669207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.077 × 10¹⁰⁰(101-digit number)
20779984250946448584…53988832319338414079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.155 × 10¹⁰⁰(101-digit number)
41559968501892897168…07977664638676828159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.311 × 10¹⁰⁰(101-digit number)
83119937003785794336…15955329277353656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.662 × 10¹⁰¹(102-digit number)
16623987400757158867…31910658554707312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.324 × 10¹⁰¹(102-digit number)
33247974801514317734…63821317109414625279
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,702,559 XPM·at block #6,807,317 · 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