Block #339,834

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2014, 9:09:58 AM · Difficulty 10.1301 · 6,469,216 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6d5af844a25d707391c72ed2f87687caddd3951a96144789caffa343a1aa0a7c

Height

#339,834

Difficulty

10.130102

Transactions

13

Size

8.43 KB

Version

2

Bits

0a214e57

Nonce

30,266

Timestamp

1/2/2014, 9:09:58 AM

Confirmations

6,469,216

Merkle Root

da4b91b9a784dede53c79d1be76dec9cc9dc35b784c1aa104d5816fa348faecd
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.

2.126 × 10¹⁰²(103-digit number)
21268157362045116170…79025100271558182401
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
2.126 × 10¹⁰²(103-digit number)
21268157362045116170…79025100271558182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.253 × 10¹⁰²(103-digit number)
42536314724090232340…58050200543116364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.507 × 10¹⁰²(103-digit number)
85072629448180464681…16100401086232729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.701 × 10¹⁰³(104-digit number)
17014525889636092936…32200802172465459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.402 × 10¹⁰³(104-digit number)
34029051779272185872…64401604344930918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.805 × 10¹⁰³(104-digit number)
68058103558544371745…28803208689861836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.361 × 10¹⁰⁴(105-digit number)
13611620711708874349…57606417379723673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.722 × 10¹⁰⁴(105-digit number)
27223241423417748698…15212834759447347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.444 × 10¹⁰⁴(105-digit number)
54446482846835497396…30425669518894694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.088 × 10¹⁰⁵(106-digit number)
10889296569367099479…60851339037789388801
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,716,465 XPM·at block #6,809,049 · 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