Block #1,440,059

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/2/2016, 8:04:39 PM · Difficulty 10.7728 · 5,403,941 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff3c0581a0e4f5dbe11b13071278583bf2a5af1cfba1e3568171bf978d5b2872

Height

#1,440,059

Difficulty

10.772837

Transactions

2

Size

1.01 KB

Version

2

Bits

0ac5d8a2

Nonce

361,606,968

Timestamp

2/2/2016, 8:04:39 PM

Confirmations

5,403,941

Merkle Root

3be1af9ec1ad87db5bd81924b7a5d43bbc0fafb8293bebe4b2fc964832898fff
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.036 × 10⁹⁴(95-digit number)
10364837370261698906…08334605544960335361
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.036 × 10⁹⁴(95-digit number)
10364837370261698906…08334605544960335361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.072 × 10⁹⁴(95-digit number)
20729674740523397813…16669211089920670721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.145 × 10⁹⁴(95-digit number)
41459349481046795626…33338422179841341441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.291 × 10⁹⁴(95-digit number)
82918698962093591252…66676844359682682881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.658 × 10⁹⁵(96-digit number)
16583739792418718250…33353688719365365761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.316 × 10⁹⁵(96-digit number)
33167479584837436500…66707377438730731521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.633 × 10⁹⁵(96-digit number)
66334959169674873001…33414754877461463041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.326 × 10⁹⁶(97-digit number)
13266991833934974600…66829509754922926081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.653 × 10⁹⁶(97-digit number)
26533983667869949200…33659019509845852161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.306 × 10⁹⁶(97-digit number)
53067967335739898401…67318039019691704321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.061 × 10⁹⁷(98-digit number)
10613593467147979680…34636078039383408641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,996,382 XPM·at block #6,843,999 · 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