Block #320,479

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 4:31:52 PM · Difficulty 10.1838 · 6,492,396 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e26414a4610a25ffd3e855df1ac517bd214b4c63c475ea32f800d94b470d9c2

Height

#320,479

Difficulty

10.183788

Transactions

1

Size

1.11 KB

Version

2

Bits

0a2f0cb8

Nonce

21,475

Timestamp

12/19/2013, 4:31:52 PM

Confirmations

6,492,396

Merkle Root

8c0aba1830f247facc58f590233254eb275108bd6ec181a91e1da33372ff32a2
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.

5.109 × 10⁹⁴(95-digit number)
51099943720889623506…43998731704608532481
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
5.109 × 10⁹⁴(95-digit number)
51099943720889623506…43998731704608532481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.021 × 10⁹⁵(96-digit number)
10219988744177924701…87997463409217064961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.043 × 10⁹⁵(96-digit number)
20439977488355849402…75994926818434129921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.087 × 10⁹⁵(96-digit number)
40879954976711698804…51989853636868259841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.175 × 10⁹⁵(96-digit number)
81759909953423397609…03979707273736519681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.635 × 10⁹⁶(97-digit number)
16351981990684679521…07959414547473039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.270 × 10⁹⁶(97-digit number)
32703963981369359043…15918829094946078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.540 × 10⁹⁶(97-digit number)
65407927962738718087…31837658189892157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.308 × 10⁹⁷(98-digit number)
13081585592547743617…63675316379784314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.616 × 10⁹⁷(98-digit number)
26163171185095487235…27350632759568629761
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,747,031 XPM·at block #6,812,874 · 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