Block #440,617

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 1:35:37 PM · Difficulty 10.3509 · 6,367,391 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4982b041d3febd416921f3c62526d896a9a2933412c62e8accd5a0f34f3f87d7

Height

#440,617

Difficulty

10.350948

Transactions

3

Size

2.61 KB

Version

2

Bits

0a59d7c2

Nonce

4,635

Timestamp

3/12/2014, 1:35:37 PM

Confirmations

6,367,391

Merkle Root

6c4c2aa132bce445bfa5486439b4ddbf37de88804c355bd075efc6eb92fcee79
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.

4.263 × 10¹⁰⁰(101-digit number)
42634992833718012471…11760718157922132481
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
4.263 × 10¹⁰⁰(101-digit number)
42634992833718012471…11760718157922132481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.526 × 10¹⁰⁰(101-digit number)
85269985667436024942…23521436315844264961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.705 × 10¹⁰¹(102-digit number)
17053997133487204988…47042872631688529921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.410 × 10¹⁰¹(102-digit number)
34107994266974409976…94085745263377059841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.821 × 10¹⁰¹(102-digit number)
68215988533948819953…88171490526754119681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.364 × 10¹⁰²(103-digit number)
13643197706789763990…76342981053508239361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.728 × 10¹⁰²(103-digit number)
27286395413579527981…52685962107016478721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.457 × 10¹⁰²(103-digit number)
54572790827159055963…05371924214032957441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.091 × 10¹⁰³(104-digit number)
10914558165431811192…10743848428065914881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.182 × 10¹⁰³(104-digit number)
21829116330863622385…21487696856131829761
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,708,105 XPM·at block #6,808,007 · 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