Block #1,535,145

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 5:08:50 PM · Difficulty 10.6202 · 5,280,868 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b4d04af2d8e2aaca1c972852c7d32e0b2cd341d5bd0ed21f664f29895397a6d7

Height

#1,535,145

Difficulty

10.620231

Transactions

2

Size

1.08 KB

Version

2

Bits

0a9ec76f

Nonce

621,207,305

Timestamp

4/10/2016, 5:08:50 PM

Confirmations

5,280,868

Merkle Root

1dc827707e3d51a6846590fc2a38d7bff049ef6d9b173a3bac180e7bf9827813
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.

3.265 × 10⁹⁴(95-digit number)
32651386119998427138…41063265168453016721
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
3.265 × 10⁹⁴(95-digit number)
32651386119998427138…41063265168453016721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.530 × 10⁹⁴(95-digit number)
65302772239996854277…82126530336906033441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.306 × 10⁹⁵(96-digit number)
13060554447999370855…64253060673812066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.612 × 10⁹⁵(96-digit number)
26121108895998741711…28506121347624133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.224 × 10⁹⁵(96-digit number)
52242217791997483422…57012242695248267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.044 × 10⁹⁶(97-digit number)
10448443558399496684…14024485390496535041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.089 × 10⁹⁶(97-digit number)
20896887116798993368…28048970780993070081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.179 × 10⁹⁶(97-digit number)
41793774233597986737…56097941561986140161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.358 × 10⁹⁶(97-digit number)
83587548467195973475…12195883123972280321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.671 × 10⁹⁷(98-digit number)
16717509693439194695…24391766247944560641
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,772,222 XPM·at block #6,816,012 · 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