Block #1,150,354

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/11/2015, 11:03:02 AM · Difficulty 10.9450 · 5,656,471 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6c9d20c00957bc278032ee14522c2055a3d8093ec71fad872f4a4114b3530457

Height

#1,150,354

Difficulty

10.944980

Transactions

6

Size

1.73 KB

Version

2

Bits

0af1ea3b

Nonce

471,353,876

Timestamp

7/11/2015, 11:03:02 AM

Confirmations

5,656,471

Merkle Root

cd2e1e9345eacebd960643541698a0dd7f8fa843ec77f55792cde6d3e541b695
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.610 × 10⁹³(94-digit number)
86102608425328915103…80476517832893391799
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.610 × 10⁹³(94-digit number)
86102608425328915103…80476517832893391799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.722 × 10⁹⁴(95-digit number)
17220521685065783020…60953035665786783599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.444 × 10⁹⁴(95-digit number)
34441043370131566041…21906071331573567199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.888 × 10⁹⁴(95-digit number)
68882086740263132083…43812142663147134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.377 × 10⁹⁵(96-digit number)
13776417348052626416…87624285326294268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.755 × 10⁹⁵(96-digit number)
27552834696105252833…75248570652588537599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.510 × 10⁹⁵(96-digit number)
55105669392210505666…50497141305177075199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.102 × 10⁹⁶(97-digit number)
11021133878442101133…00994282610354150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.204 × 10⁹⁶(97-digit number)
22042267756884202266…01988565220708300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.408 × 10⁹⁶(97-digit number)
44084535513768404533…03977130441416601599
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,698,702 XPM·at block #6,806,824 · 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