Block #1,167,345

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/23/2015, 10:05:19 PM · Difficulty 10.9341 · 5,642,346 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8276c6eca6d04aa934aefe150459818a5ed13e30215849359c339a2a97bfbc7a

Height

#1,167,345

Difficulty

10.934127

Transactions

3

Size

1.07 KB

Version

2

Bits

0aef22f8

Nonce

584,519,266

Timestamp

7/23/2015, 10:05:19 PM

Confirmations

5,642,346

Merkle Root

f3aa142d5ffb988ead4b7340a6483e4a81fd37dde2982e3c4100591de4033285
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.020 × 10⁹⁴(95-digit number)
20208194674537148468…65661619532276726139
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.020 × 10⁹⁴(95-digit number)
20208194674537148468…65661619532276726139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.041 × 10⁹⁴(95-digit number)
40416389349074296936…31323239064553452279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.083 × 10⁹⁴(95-digit number)
80832778698148593872…62646478129106904559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.616 × 10⁹⁵(96-digit number)
16166555739629718774…25292956258213809119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.233 × 10⁹⁵(96-digit number)
32333111479259437548…50585912516427618239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.466 × 10⁹⁵(96-digit number)
64666222958518875097…01171825032855236479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.293 × 10⁹⁶(97-digit number)
12933244591703775019…02343650065710472959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.586 × 10⁹⁶(97-digit number)
25866489183407550039…04687300131420945919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.173 × 10⁹⁶(97-digit number)
51732978366815100078…09374600262841891839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.034 × 10⁹⁷(98-digit number)
10346595673363020015…18749200525683783679
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,721,604 XPM·at block #6,809,690 · 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