Block #316,223

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 10:57:29 PM · Difficulty 10.1287 · 6,491,120 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ae2a2a376d7d665580366ac79636bd50efc5e21ed22728fa05fb57d6c7c53cdf

Height

#316,223

Difficulty

10.128722

Transactions

1

Size

1.05 KB

Version

2

Bits

0a20f3e5

Nonce

59,888

Timestamp

12/16/2013, 10:57:29 PM

Confirmations

6,491,120

Merkle Root

cbd6a80964f28210e0dfcdc1ca9b30e60e60766fab2ee9406d0f16cdf7de6483
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.228 × 10⁹⁷(98-digit number)
92284741968819875338…53421586070674097161
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.228 × 10⁹⁷(98-digit number)
92284741968819875338…53421586070674097161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.845 × 10⁹⁸(99-digit number)
18456948393763975067…06843172141348194321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.691 × 10⁹⁸(99-digit number)
36913896787527950135…13686344282696388641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.382 × 10⁹⁸(99-digit number)
73827793575055900271…27372688565392777281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.476 × 10⁹⁹(100-digit number)
14765558715011180054…54745377130785554561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.953 × 10⁹⁹(100-digit number)
29531117430022360108…09490754261571109121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.906 × 10⁹⁹(100-digit number)
59062234860044720216…18981508523142218241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.181 × 10¹⁰⁰(101-digit number)
11812446972008944043…37963017046284436481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.362 × 10¹⁰⁰(101-digit number)
23624893944017888086…75926034092568872961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.724 × 10¹⁰⁰(101-digit number)
47249787888035776173…51852068185137745921
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,702,763 XPM·at block #6,807,342 · 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