Block #381,790

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/30/2014, 6:46:43 AM · Difficulty 10.4008 · 6,424,470 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
563f9111bf5063eec65ca91ff4ec009537aacbfbcba08eb07a36e141c54edbe6

Height

#381,790

Difficulty

10.400813

Transactions

6

Size

1.43 KB

Version

2

Bits

0a669ba9

Nonce

28,599

Timestamp

1/30/2014, 6:46:43 AM

Confirmations

6,424,470

Merkle Root

10a0074e4c18d503e28877ec5ad2c2471ad609b5e1746425ef6c3c360383bfc8
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.018 × 10¹⁰⁰(101-digit number)
10182571102698202840…00967787871315804159
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.018 × 10¹⁰⁰(101-digit number)
10182571102698202840…00967787871315804159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.036 × 10¹⁰⁰(101-digit number)
20365142205396405680…01935575742631608319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.073 × 10¹⁰⁰(101-digit number)
40730284410792811360…03871151485263216639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.146 × 10¹⁰⁰(101-digit number)
81460568821585622721…07742302970526433279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.629 × 10¹⁰¹(102-digit number)
16292113764317124544…15484605941052866559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.258 × 10¹⁰¹(102-digit number)
32584227528634249088…30969211882105733119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.516 × 10¹⁰¹(102-digit number)
65168455057268498177…61938423764211466239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.303 × 10¹⁰²(103-digit number)
13033691011453699635…23876847528422932479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.606 × 10¹⁰²(103-digit number)
26067382022907399271…47753695056845864959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.213 × 10¹⁰²(103-digit number)
52134764045814798542…95507390113691729919
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,694,164 XPM·at block #6,806,259 · 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