Block #335,519

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2013, 7:31:11 AM · Difficulty 10.1460 · 6,507,495 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e381620f4309a1c83177fd6a40c938110d4c94aafa78cb3601eb25b1cae457e

Height

#335,519

Difficulty

10.146031

Transactions

1

Size

1.05 KB

Version

2

Bits

0a256252

Nonce

2,071

Timestamp

12/30/2013, 7:31:11 AM

Confirmations

6,507,495

Merkle Root

4486b4fe8e0fe9dbdc6e9f43e936c62e32fa7406c8a49c49d920b4a3ef3cabce
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.111 × 10⁹⁵(96-digit number)
51110827952182800180…80709085922970801921
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.111 × 10⁹⁵(96-digit number)
51110827952182800180…80709085922970801921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.022 × 10⁹⁶(97-digit number)
10222165590436560036…61418171845941603841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.044 × 10⁹⁶(97-digit number)
20444331180873120072…22836343691883207681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.088 × 10⁹⁶(97-digit number)
40888662361746240144…45672687383766415361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.177 × 10⁹⁶(97-digit number)
81777324723492480289…91345374767532830721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.635 × 10⁹⁷(98-digit number)
16355464944698496057…82690749535065661441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.271 × 10⁹⁷(98-digit number)
32710929889396992115…65381499070131322881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.542 × 10⁹⁷(98-digit number)
65421859778793984231…30762998140262645761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.308 × 10⁹⁸(99-digit number)
13084371955758796846…61525996280525291521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.616 × 10⁹⁸(99-digit number)
26168743911517593692…23051992561050583041
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,988,467 XPM·at block #6,843,013 · 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