Block #1,542,698

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2016, 4:23:20 PM · Difficulty 10.6493 · 5,272,354 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f2538f7cf5023b95a6035fffe2b04197349f7ab1b8ebc7c40beb707d3d9a00c8

Height

#1,542,698

Difficulty

10.649274

Transactions

41

Size

21.21 KB

Version

2

Bits

0aa636d5

Nonce

954,453,147

Timestamp

4/15/2016, 4:23:20 PM

Confirmations

5,272,354

Merkle Root

722d3523e4a5926643d2b3b2998906c077919b86439dd93e9c0967c51a29616c
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.874 × 10⁹²(93-digit number)
18744830821875212117…44246808763588547201
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.874 × 10⁹²(93-digit number)
18744830821875212117…44246808763588547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.748 × 10⁹²(93-digit number)
37489661643750424234…88493617527177094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.497 × 10⁹²(93-digit number)
74979323287500848468…76987235054354188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.499 × 10⁹³(94-digit number)
14995864657500169693…53974470108708377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.999 × 10⁹³(94-digit number)
29991729315000339387…07948940217416755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.998 × 10⁹³(94-digit number)
59983458630000678775…15897880434833510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.199 × 10⁹⁴(95-digit number)
11996691726000135755…31795760869667020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.399 × 10⁹⁴(95-digit number)
23993383452000271510…63591521739334041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.798 × 10⁹⁴(95-digit number)
47986766904000543020…27183043478668083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.597 × 10⁹⁴(95-digit number)
95973533808001086040…54366086957336166401
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,764,507 XPM·at block #6,815,051 · 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