Block #306,845

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2013, 6:53:30 AM · Difficulty 9.9939 · 6,510,343 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5a6b533bd62f47d002dfd2d13db1a8ab333bb4da12ad3d83dc71ea0311db07b0

Height

#306,845

Difficulty

9.993917

Transactions

5

Size

1.11 KB

Version

2

Bits

09fe7157

Nonce

28,198

Timestamp

12/12/2013, 6:53:30 AM

Confirmations

6,510,343

Merkle Root

28b820118b1c7ca628346199c8b2d531234c193ddf991b9b576c34e015bcddb0
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.587 × 10¹⁰³(104-digit number)
15873869905309661235…13768756134840545921
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.587 × 10¹⁰³(104-digit number)
15873869905309661235…13768756134840545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.174 × 10¹⁰³(104-digit number)
31747739810619322471…27537512269681091841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.349 × 10¹⁰³(104-digit number)
63495479621238644942…55075024539362183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.269 × 10¹⁰⁴(105-digit number)
12699095924247728988…10150049078724367361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.539 × 10¹⁰⁴(105-digit number)
25398191848495457976…20300098157448734721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.079 × 10¹⁰⁴(105-digit number)
50796383696990915953…40600196314897469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.015 × 10¹⁰⁵(106-digit number)
10159276739398183190…81200392629794938881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.031 × 10¹⁰⁵(106-digit number)
20318553478796366381…62400785259589877761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.063 × 10¹⁰⁵(106-digit number)
40637106957592732762…24801570519179755521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.127 × 10¹⁰⁵(106-digit number)
81274213915185465525…49603141038359511041
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,539 XPM·at block #6,817,187 · 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