Block #335,418

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2013, 5:27:08 AM · Difficulty 10.1499 · 6,470,942 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab7311f463772eb7b9f1d3df7335066dec28ac0ce5b01583edf62c815d73cb9a

Height

#335,418

Difficulty

10.149854

Transactions

8

Size

1.69 KB

Version

2

Bits

0a265cd5

Nonce

235,784

Timestamp

12/30/2013, 5:27:08 AM

Confirmations

6,470,942

Merkle Root

0ac0e375eb6b51b4d7b25448721d413314d021256a5a9f70ffdc8d96e0b22712
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.217 × 10¹⁰⁰(101-digit number)
12171104039889572394…48686264194627270481
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.217 × 10¹⁰⁰(101-digit number)
12171104039889572394…48686264194627270481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.434 × 10¹⁰⁰(101-digit number)
24342208079779144789…97372528389254540961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.868 × 10¹⁰⁰(101-digit number)
48684416159558289579…94745056778509081921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.736 × 10¹⁰⁰(101-digit number)
97368832319116579159…89490113557018163841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.947 × 10¹⁰¹(102-digit number)
19473766463823315831…78980227114036327681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.894 × 10¹⁰¹(102-digit number)
38947532927646631663…57960454228072655361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.789 × 10¹⁰¹(102-digit number)
77895065855293263327…15920908456145310721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.557 × 10¹⁰²(103-digit number)
15579013171058652665…31841816912290621441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.115 × 10¹⁰²(103-digit number)
31158026342117305331…63683633824581242881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.231 × 10¹⁰²(103-digit number)
62316052684234610662…27367267649162485761
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,694,967 XPM·at block #6,806,359 · 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