Block #1,592,151

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2016, 12:39:02 AM · Difficulty 10.6512 · 5,248,789 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0473217edac4b8aac4467b2eb8e0ff731362119d50fb95598e4e29595bf85260

Height

#1,592,151

Difficulty

10.651233

Transactions

2

Size

1017 B

Version

2

Bits

0aa6b72e

Nonce

405,359,194

Timestamp

5/20/2016, 12:39:02 AM

Confirmations

5,248,789

Merkle Root

4d88c3e0f5883a44d8931302a1e5b79a46b187aef069f4bb1073f78179d834a8
Transactions (2)
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.654 × 10⁹⁴(95-digit number)
46543728246079216532…51519106494408078721
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.654 × 10⁹⁴(95-digit number)
46543728246079216532…51519106494408078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.308 × 10⁹⁴(95-digit number)
93087456492158433065…03038212988816157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.861 × 10⁹⁵(96-digit number)
18617491298431686613…06076425977632314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.723 × 10⁹⁵(96-digit number)
37234982596863373226…12152851955264629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.446 × 10⁹⁵(96-digit number)
74469965193726746452…24305703910529259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.489 × 10⁹⁶(97-digit number)
14893993038745349290…48611407821058519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.978 × 10⁹⁶(97-digit number)
29787986077490698580…97222815642117038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.957 × 10⁹⁶(97-digit number)
59575972154981397161…94445631284234076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.191 × 10⁹⁷(98-digit number)
11915194430996279432…88891262568468152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.383 × 10⁹⁷(98-digit number)
23830388861992558864…77782525136936304641
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,971,874 XPM·at block #6,840,939 · 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