Block #303,723

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 1:04:00 PM · Difficulty 9.9931 · 6,506,328 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4a94fe5dbb2e999fefe322829a438f7e92e05f83a2be81e0eae422b67c51e15d

Height

#303,723

Difficulty

9.993101

Transactions

16

Size

3.62 KB

Version

2

Bits

09fe3bde

Nonce

54,546

Timestamp

12/10/2013, 1:04:00 PM

Confirmations

6,506,328

Merkle Root

70e1bd7985909b107de962a58e127382ffaca2c6768c9db95ec2f0f234b517c9
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.

1.149 × 10⁹⁵(96-digit number)
11499004586548320256…42210682563380984801
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
1.149 × 10⁹⁵(96-digit number)
11499004586548320256…42210682563380984801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.299 × 10⁹⁵(96-digit number)
22998009173096640513…84421365126761969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.599 × 10⁹⁵(96-digit number)
45996018346193281027…68842730253523939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.199 × 10⁹⁵(96-digit number)
91992036692386562054…37685460507047878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.839 × 10⁹⁶(97-digit number)
18398407338477312410…75370921014095756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.679 × 10⁹⁶(97-digit number)
36796814676954624821…50741842028191513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.359 × 10⁹⁶(97-digit number)
73593629353909249643…01483684056383027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.471 × 10⁹⁷(98-digit number)
14718725870781849928…02967368112766054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.943 × 10⁹⁷(98-digit number)
29437451741563699857…05934736225532108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.887 × 10⁹⁷(98-digit number)
58874903483127399714…11869472451064217601
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,724,481 XPM·at block #6,810,050 · 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