Block #397,671

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/10/2014, 6:20:35 AM · Difficulty 10.4143 · 6,410,170 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2332a155fbccaad0ee7cad1e8f9677adb19d1925ae3ee564ecf1eff9411b0b39

Height

#397,671

Difficulty

10.414258

Transactions

3

Size

870 B

Version

2

Bits

0a6a0ccc

Nonce

29,384

Timestamp

2/10/2014, 6:20:35 AM

Confirmations

6,410,170

Merkle Root

372d885baf9eda40bd1d32be05636f8a55651d7de5c5f631f8c633ce7f32a511
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.120 × 10¹⁰⁰(101-digit number)
21207826709096586157…50510510622709706799
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.120 × 10¹⁰⁰(101-digit number)
21207826709096586157…50510510622709706799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.241 × 10¹⁰⁰(101-digit number)
42415653418193172314…01021021245419413599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.483 × 10¹⁰⁰(101-digit number)
84831306836386344629…02042042490838827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.696 × 10¹⁰¹(102-digit number)
16966261367277268925…04084084981677654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.393 × 10¹⁰¹(102-digit number)
33932522734554537851…08168169963355308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.786 × 10¹⁰¹(102-digit number)
67865045469109075703…16336339926710617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.357 × 10¹⁰²(103-digit number)
13573009093821815140…32672679853421235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.714 × 10¹⁰²(103-digit number)
27146018187643630281…65345359706842470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.429 × 10¹⁰²(103-digit number)
54292036375287260562…30690719413684940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.085 × 10¹⁰³(104-digit number)
10858407275057452112…61381438827369881599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,706,766 XPM·at block #6,807,840 · 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