Block #393,094

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/6/2014, 9:27:11 PM · Difficulty 10.4440 · 6,424,301 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
24e8510eaa6ae0a0a3a21335f2a874583b83f005913ce35433dd1faa14f0d771

Height

#393,094

Difficulty

10.444007

Transactions

1

Size

935 B

Version

2

Bits

0a71aa69

Nonce

129,434

Timestamp

2/6/2014, 9:27:11 PM

Confirmations

6,424,301

Merkle Root

534db79d998d75bef16590c2411ccb3ebdf54073fbbd4051c25a6bb8d579f3ac
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.

3.394 × 10⁹⁴(95-digit number)
33943317835766140653…55494929368988677219
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
3.394 × 10⁹⁴(95-digit number)
33943317835766140653…55494929368988677219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.788 × 10⁹⁴(95-digit number)
67886635671532281306…10989858737977354439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.357 × 10⁹⁵(96-digit number)
13577327134306456261…21979717475954708879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.715 × 10⁹⁵(96-digit number)
27154654268612912522…43959434951909417759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.430 × 10⁹⁵(96-digit number)
54309308537225825044…87918869903818835519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.086 × 10⁹⁶(97-digit number)
10861861707445165008…75837739807637671039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.172 × 10⁹⁶(97-digit number)
21723723414890330017…51675479615275342079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.344 × 10⁹⁶(97-digit number)
43447446829780660035…03350959230550684159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.689 × 10⁹⁶(97-digit number)
86894893659561320071…06701918461101368319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.737 × 10⁹⁷(98-digit number)
17378978731912264014…13403836922202736639
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,783,202 XPM·at block #6,817,394 · 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.
Privacy Policy·

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