Block #286,755

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 12:42:29 AM · Difficulty 9.9860 · 6,530,429 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e37bd2da43ab8ca79f80fcfa353ee6afd9c770389f1bb616dc7bd3779a732e4c

Height

#286,755

Difficulty

9.985974

Transactions

12

Size

3.56 KB

Version

2

Bits

09fc68d0

Nonce

15,930

Timestamp

12/1/2013, 12:42:29 AM

Confirmations

6,530,429

Merkle Root

42cb064b1758b21029cdff9f7dc68c5f100ec1f858cb8ec7f223deed39c86f20
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.511 × 10¹⁰⁴(105-digit number)
35110240294421793476…82990646780598918681
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.511 × 10¹⁰⁴(105-digit number)
35110240294421793476…82990646780598918681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.022 × 10¹⁰⁴(105-digit number)
70220480588843586952…65981293561197837361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.404 × 10¹⁰⁵(106-digit number)
14044096117768717390…31962587122395674721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.808 × 10¹⁰⁵(106-digit number)
28088192235537434780…63925174244791349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.617 × 10¹⁰⁵(106-digit number)
56176384471074869561…27850348489582698881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.123 × 10¹⁰⁶(107-digit number)
11235276894214973912…55700696979165397761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.247 × 10¹⁰⁶(107-digit number)
22470553788429947824…11401393958330795521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.494 × 10¹⁰⁶(107-digit number)
44941107576859895649…22802787916661591041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.988 × 10¹⁰⁶(107-digit number)
89882215153719791298…45605575833323182081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.797 × 10¹⁰⁷(108-digit number)
17976443030743958259…91211151666646364161
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,781,507 XPM·at block #6,817,183 · 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