Block #1,403,793

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2016, 1:42:56 AM · Difficulty 10.8064 · 5,437,329 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ec47ed9a5732ead0827c853df328cff28aa017d50929b17231f616a8e38b9b76

Height

#1,403,793

Difficulty

10.806359

Transactions

2

Size

1018 B

Version

2

Bits

0ace6d90

Nonce

459,907,733

Timestamp

1/8/2016, 1:42:56 AM

Confirmations

5,437,329

Merkle Root

9f4259991a4504752c1de836402425930f543b443f38459ee25637da68a1b9e7
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.

9.261 × 10⁹²(93-digit number)
92615226800815682964…33707680965994080961
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
9.261 × 10⁹²(93-digit number)
92615226800815682964…33707680965994080961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.852 × 10⁹³(94-digit number)
18523045360163136592…67415361931988161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.704 × 10⁹³(94-digit number)
37046090720326273185…34830723863976323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.409 × 10⁹³(94-digit number)
74092181440652546371…69661447727952647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.481 × 10⁹⁴(95-digit number)
14818436288130509274…39322895455905295361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.963 × 10⁹⁴(95-digit number)
29636872576261018548…78645790911810590721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.927 × 10⁹⁴(95-digit number)
59273745152522037097…57291581823621181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.185 × 10⁹⁵(96-digit number)
11854749030504407419…14583163647242362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.370 × 10⁹⁵(96-digit number)
23709498061008814838…29166327294484725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.741 × 10⁹⁵(96-digit number)
47418996122017629677…58332654588969451521
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,973,345 XPM·at block #6,841,121 · 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