Block #389,381

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/4/2014, 11:14:37 AM · Difficulty 10.4184 · 6,420,963 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cc1fce87d6a22e966f9b28d8b75a2737d576089888e1d491829828322d18e268

Height

#389,381

Difficulty

10.418436

Transactions

5

Size

1.23 KB

Version

2

Bits

0a6b1e9a

Nonce

2,880

Timestamp

2/4/2014, 11:14:37 AM

Confirmations

6,420,963

Merkle Root

addf6bb9801315bd00c72dd3dc325542b0c083c51a1cbe89e0114d963cb090ea
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.562 × 10¹⁰⁰(101-digit number)
15620330777542226785…98818444349865533441
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.562 × 10¹⁰⁰(101-digit number)
15620330777542226785…98818444349865533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.124 × 10¹⁰⁰(101-digit number)
31240661555084453570…97636888699731066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.248 × 10¹⁰⁰(101-digit number)
62481323110168907141…95273777399462133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.249 × 10¹⁰¹(102-digit number)
12496264622033781428…90547554798924267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.499 × 10¹⁰¹(102-digit number)
24992529244067562856…81095109597848535041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.998 × 10¹⁰¹(102-digit number)
49985058488135125713…62190219195697070081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.997 × 10¹⁰¹(102-digit number)
99970116976270251427…24380438391394140161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.999 × 10¹⁰²(103-digit number)
19994023395254050285…48760876782788280321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.998 × 10¹⁰²(103-digit number)
39988046790508100570…97521753565576560641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.997 × 10¹⁰²(103-digit number)
79976093581016201141…95043507131153121281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.599 × 10¹⁰³(104-digit number)
15995218716203240228…90087014262306242561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,726,834 XPM·at block #6,810,343 · 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