Block #1,543,674

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2016, 8:03:30 AM · Difficulty 10.6519 · 5,273,291 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
649aaa94504822018ed6c753bcb3b75bb4f3a39ef477c2a4a80e660d92ff78d1

Height

#1,543,674

Difficulty

10.651858

Transactions

3

Size

1.85 KB

Version

2

Bits

0aa6e031

Nonce

1,833,899,704

Timestamp

4/16/2016, 8:03:30 AM

Confirmations

5,273,291

Merkle Root

3c4feb225b77e5f95c7ab0b0a84e817301765961b8f02e7d466731c697e6da7a
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.361 × 10⁹³(94-digit number)
63616806051262240769…30922386230627423061
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.361 × 10⁹³(94-digit number)
63616806051262240769…30922386230627423061
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.272 × 10⁹⁴(95-digit number)
12723361210252448153…61844772461254846121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.544 × 10⁹⁴(95-digit number)
25446722420504896307…23689544922509692241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.089 × 10⁹⁴(95-digit number)
50893444841009792615…47379089845019384481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.017 × 10⁹⁵(96-digit number)
10178688968201958523…94758179690038768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.035 × 10⁹⁵(96-digit number)
20357377936403917046…89516359380077537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.071 × 10⁹⁵(96-digit number)
40714755872807834092…79032718760155075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.142 × 10⁹⁵(96-digit number)
81429511745615668185…58065437520310151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.628 × 10⁹⁶(97-digit number)
16285902349123133637…16130875040620303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.257 × 10⁹⁶(97-digit number)
32571804698246267274…32261750081240606721
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,779,756 XPM·at block #6,816,964 · 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