Block #440,709

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 3:04:54 PM · Difficulty 10.3515 · 6,367,528 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7114021504a803ecabb3c263f3e8358e6837f37007a0f1fd04f30de11fd95c02

Height

#440,709

Difficulty

10.351548

Transactions

6

Size

1.90 KB

Version

2

Bits

0a59ff0d

Nonce

114,066

Timestamp

3/12/2014, 3:04:54 PM

Confirmations

6,367,528

Merkle Root

7bad9f67a801ebaad12fefc1d52b65f298edb03dc76c155778d5d0ca00ac3333
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.174 × 10⁹⁰(91-digit number)
11742828868582920417…85651923267314807101
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.174 × 10⁹⁰(91-digit number)
11742828868582920417…85651923267314807101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.348 × 10⁹⁰(91-digit number)
23485657737165840834…71303846534629614201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.697 × 10⁹⁰(91-digit number)
46971315474331681668…42607693069259228401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.394 × 10⁹⁰(91-digit number)
93942630948663363336…85215386138518456801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.878 × 10⁹¹(92-digit number)
18788526189732672667…70430772277036913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.757 × 10⁹¹(92-digit number)
37577052379465345334…40861544554073827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.515 × 10⁹¹(92-digit number)
75154104758930690669…81723089108147654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.503 × 10⁹²(93-digit number)
15030820951786138133…63446178216295308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.006 × 10⁹²(93-digit number)
30061641903572276267…26892356432590617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.012 × 10⁹²(93-digit number)
60123283807144552535…53784712865181235201
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,709,942 XPM·at block #6,808,236 · 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