Block #388,308

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/3/2014, 5:17:58 PM · Difficulty 10.4182 · 6,421,506 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5eff03501aec25f5c672ccb4ac8e18a20bb9c1a2d9d2d53ddf8e6a6b13cacaf8

Height

#388,308

Difficulty

10.418187

Transactions

7

Size

2.46 KB

Version

2

Bits

0a6b0e47

Nonce

15,299

Timestamp

2/3/2014, 5:17:58 PM

Confirmations

6,421,506

Merkle Root

f81a517c38d25c81c33f1c47511c19c39adf5b4dacbe6912076f5f8b9cb33fb4
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.601 × 10¹⁰⁶(107-digit number)
16016457742165377676…38306693533092645601
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.601 × 10¹⁰⁶(107-digit number)
16016457742165377676…38306693533092645601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.203 × 10¹⁰⁶(107-digit number)
32032915484330755352…76613387066185291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.406 × 10¹⁰⁶(107-digit number)
64065830968661510705…53226774132370582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.281 × 10¹⁰⁷(108-digit number)
12813166193732302141…06453548264741164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.562 × 10¹⁰⁷(108-digit number)
25626332387464604282…12907096529482329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.125 × 10¹⁰⁷(108-digit number)
51252664774929208564…25814193058964659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.025 × 10¹⁰⁸(109-digit number)
10250532954985841712…51628386117929318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.050 × 10¹⁰⁸(109-digit number)
20501065909971683425…03256772235858636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.100 × 10¹⁰⁸(109-digit number)
41002131819943366851…06513544471717273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.200 × 10¹⁰⁸(109-digit number)
82004263639886733703…13027088943434547201
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,722,595 XPM·at block #6,809,813 · 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