Block #383,876

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 4:52:28 PM · Difficulty 10.4047 · 6,428,862 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a3b99664d27a85051aa526f33797f90e03a7a4b82ef33861927ad34fe645bf3e

Height

#383,876

Difficulty

10.404748

Transactions

2

Size

722 B

Version

2

Bits

0a679d91

Nonce

243,061

Timestamp

1/31/2014, 4:52:28 PM

Confirmations

6,428,862

Merkle Root

29a078db8436438ce656d9e605e93d6c24b1a6ceca9a23e992121aee6c8fa7d2
Transactions (2)
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.068 × 10⁹³(94-digit number)
10686721376397288738…84077851126865695999
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.068 × 10⁹³(94-digit number)
10686721376397288738…84077851126865695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.137 × 10⁹³(94-digit number)
21373442752794577477…68155702253731391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.274 × 10⁹³(94-digit number)
42746885505589154954…36311404507462783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.549 × 10⁹³(94-digit number)
85493771011178309908…72622809014925567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.709 × 10⁹⁴(95-digit number)
17098754202235661981…45245618029851135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.419 × 10⁹⁴(95-digit number)
34197508404471323963…90491236059702271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.839 × 10⁹⁴(95-digit number)
68395016808942647926…80982472119404543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.367 × 10⁹⁵(96-digit number)
13679003361788529585…61964944238809087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.735 × 10⁹⁵(96-digit number)
27358006723577059170…23929888477618175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.471 × 10⁹⁵(96-digit number)
54716013447154118341…47859776955236351999
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,745,946 XPM·at block #6,812,737 · 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