Block #381,671

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/30/2014, 4:48:15 AM · Difficulty 10.4004 · 6,427,912 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a214a8c218f2227f18676b6cebfff305db7fb66a0c21f060249fe5632e80370d

Height

#381,671

Difficulty

10.400447

Transactions

16

Size

24.94 KB

Version

2

Bits

0a6683ba

Nonce

104,101

Timestamp

1/30/2014, 4:48:15 AM

Confirmations

6,427,912

Merkle Root

31ab9725c5fc44350ce3a8b4726c0ae7e967503b49a7b5389cfc6fa0aa3c6689
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.

7.037 × 10¹⁰¹(102-digit number)
70374791454115508534…96402254545116068001
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
7.037 × 10¹⁰¹(102-digit number)
70374791454115508534…96402254545116068001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.407 × 10¹⁰²(103-digit number)
14074958290823101706…92804509090232136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.814 × 10¹⁰²(103-digit number)
28149916581646203413…85609018180464272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.629 × 10¹⁰²(103-digit number)
56299833163292406827…71218036360928544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.125 × 10¹⁰³(104-digit number)
11259966632658481365…42436072721857088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.251 × 10¹⁰³(104-digit number)
22519933265316962731…84872145443714176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.503 × 10¹⁰³(104-digit number)
45039866530633925462…69744290887428352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.007 × 10¹⁰³(104-digit number)
90079733061267850924…39488581774856704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.801 × 10¹⁰⁴(105-digit number)
18015946612253570184…78977163549713408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.603 × 10¹⁰⁴(105-digit number)
36031893224507140369…57954327099426816001
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,720,741 XPM·at block #6,809,582 · 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