Block #1,534,694

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 10:07:34 AM · Difficulty 10.6178 · 5,273,867 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f2dd9ef274c1f525c4c1191b7f5bfd414f0c429d51c5a8b2fc3c28d0daf31635

Height

#1,534,694

Difficulty

10.617810

Transactions

2

Size

7.60 KB

Version

2

Bits

0a9e28c4

Nonce

1,191,654,877

Timestamp

4/10/2016, 10:07:34 AM

Confirmations

5,273,867

Merkle Root

8d5fc566d94d6a647569f6805b35da65ee6f97f03109e9ffb3eda6cb6c1a8798
Transactions (2)
1 in → 1 out8.9400 XPM109 B
51 in → 1 out3067.1049 XPM7.40 KB
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.

7.054 × 10⁹⁴(95-digit number)
70549008340722145800…72338377654693283841
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
7.054 × 10⁹⁴(95-digit number)
70549008340722145800…72338377654693283841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.410 × 10⁹⁵(96-digit number)
14109801668144429160…44676755309386567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.821 × 10⁹⁵(96-digit number)
28219603336288858320…89353510618773135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.643 × 10⁹⁵(96-digit number)
56439206672577716640…78707021237546270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.128 × 10⁹⁶(97-digit number)
11287841334515543328…57414042475092541441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.257 × 10⁹⁶(97-digit number)
22575682669031086656…14828084950185082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.515 × 10⁹⁶(97-digit number)
45151365338062173312…29656169900370165761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.030 × 10⁹⁶(97-digit number)
90302730676124346624…59312339800740331521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.806 × 10⁹⁷(98-digit number)
18060546135224869324…18624679601480663041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.612 × 10⁹⁷(98-digit number)
36121092270449738649…37249359202961326081
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,712,546 XPM·at block #6,808,560 · 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