Block #383,283

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 7:56:08 AM · Difficulty 10.3991 · 6,434,345 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0b7b06a6262b2030317a382dc33aa8d91f8ea915e192c5870848e7d1949f69bd

Height

#383,283

Difficulty

10.399137

Transactions

8

Size

2.34 KB

Version

2

Bits

0a662ddd

Nonce

21,081

Timestamp

1/31/2014, 7:56:08 AM

Confirmations

6,434,345

Merkle Root

8bc30e0379d5349e8914a59bdbc1655c6ac994f45123b604b3e748d149a998cd
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.

8.822 × 10⁹⁶(97-digit number)
88222008411875475060…79516748817641884799
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
8.822 × 10⁹⁶(97-digit number)
88222008411875475060…79516748817641884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.764 × 10⁹⁷(98-digit number)
17644401682375095012…59033497635283769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.528 × 10⁹⁷(98-digit number)
35288803364750190024…18066995270567539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.057 × 10⁹⁷(98-digit number)
70577606729500380048…36133990541135078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.411 × 10⁹⁸(99-digit number)
14115521345900076009…72267981082270156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.823 × 10⁹⁸(99-digit number)
28231042691800152019…44535962164540313599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.646 × 10⁹⁸(99-digit number)
56462085383600304038…89071924329080627199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.129 × 10⁹⁹(100-digit number)
11292417076720060807…78143848658161254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.258 × 10⁹⁹(100-digit number)
22584834153440121615…56287697316322508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.516 × 10⁹⁹(100-digit number)
45169668306880243231…12575394632645017599
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,785,075 XPM·at block #6,817,627 · 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