Block #334,535

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/29/2013, 2:01:39 PM · Difficulty 10.1568 · 6,475,831 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5734ab5880d38a6772c370d4153f58a7a82728aa56e483a2cef55540ba0503c1

Height

#334,535

Difficulty

10.156829

Transactions

30

Size

9.95 KB

Version

2

Bits

0a2825f1

Nonce

154,623

Timestamp

12/29/2013, 2:01:39 PM

Confirmations

6,475,831

Merkle Root

00a5555d417655cbd592066fb894cc634d90b204670fc33a2ba237c7d6632f60
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.048 × 10¹⁰²(103-digit number)
10489846929911118820…49573855494358220801
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.048 × 10¹⁰²(103-digit number)
10489846929911118820…49573855494358220801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.097 × 10¹⁰²(103-digit number)
20979693859822237640…99147710988716441601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.195 × 10¹⁰²(103-digit number)
41959387719644475280…98295421977432883201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.391 × 10¹⁰²(103-digit number)
83918775439288950560…96590843954865766401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.678 × 10¹⁰³(104-digit number)
16783755087857790112…93181687909731532801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.356 × 10¹⁰³(104-digit number)
33567510175715580224…86363375819463065601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.713 × 10¹⁰³(104-digit number)
67135020351431160448…72726751638926131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.342 × 10¹⁰⁴(105-digit number)
13427004070286232089…45453503277852262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.685 × 10¹⁰⁴(105-digit number)
26854008140572464179…90907006555704524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.370 × 10¹⁰⁴(105-digit number)
53708016281144928358…81814013111409049601
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,727,004 XPM·at block #6,810,365 · 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