Block #1,393,435

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2015, 7:28:49 PM · Difficulty 10.8097 · 5,431,202 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
95417f6e601c201dba88f0b32dfb72fc479934b615ad5d4b2bb1be31970dabc3

Height

#1,393,435

Difficulty

10.809734

Transactions

2

Size

42.04 KB

Version

2

Bits

0acf4abd

Nonce

654,723,270

Timestamp

12/31/2015, 7:28:49 PM

Confirmations

5,431,202

Merkle Root

5f6ddf16b86014cb9ae738e17f46b418fd9bba7b8e3dbef0c13f3a535289b8eb
Transactions (2)
1 in → 1 out8.9700 XPM109 B
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.

2.284 × 10⁹³(94-digit number)
22849314837855526292…38187028837377111361
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
2.284 × 10⁹³(94-digit number)
22849314837855526292…38187028837377111361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.569 × 10⁹³(94-digit number)
45698629675711052585…76374057674754222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.139 × 10⁹³(94-digit number)
91397259351422105171…52748115349508445441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.827 × 10⁹⁴(95-digit number)
18279451870284421034…05496230699016890881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.655 × 10⁹⁴(95-digit number)
36558903740568842068…10992461398033781761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.311 × 10⁹⁴(95-digit number)
73117807481137684136…21984922796067563521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.462 × 10⁹⁵(96-digit number)
14623561496227536827…43969845592135127041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.924 × 10⁹⁵(96-digit number)
29247122992455073654…87939691184270254081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.849 × 10⁹⁵(96-digit number)
58494245984910147309…75879382368540508161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.169 × 10⁹⁶(97-digit number)
11698849196982029461…51758764737081016321
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,841,160 XPM·at block #6,824,636 · 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