Block #1,275,394

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/10/2015, 10:51:34 AM · Difficulty 10.8252 · 5,532,948 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c3485be7d9a9f33d4368e72b4b64c3df9a1edbd31b58c416ca95b539b906a88

Height

#1,275,394

Difficulty

10.825160

Transactions

2

Size

47.24 KB

Version

2

Bits

0ad33dac

Nonce

799,427,762

Timestamp

10/10/2015, 10:51:34 AM

Confirmations

5,532,948

Merkle Root

d720a79ddefaea36abbdce0d3a5ff904949ffe308a07f11b3f4b2cbbbaa3ca33
Transactions (2)
1 in → 1 out9.2700 XPM110 B
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.880 × 10⁹²(93-digit number)
28802380254424663759…27300175042466056639
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.880 × 10⁹²(93-digit number)
28802380254424663759…27300175042466056639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.760 × 10⁹²(93-digit number)
57604760508849327518…54600350084932113279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.152 × 10⁹³(94-digit number)
11520952101769865503…09200700169864226559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.304 × 10⁹³(94-digit number)
23041904203539731007…18401400339728453119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.608 × 10⁹³(94-digit number)
46083808407079462014…36802800679456906239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.216 × 10⁹³(94-digit number)
92167616814158924029…73605601358913812479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.843 × 10⁹⁴(95-digit number)
18433523362831784805…47211202717827624959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.686 × 10⁹⁴(95-digit number)
36867046725663569611…94422405435655249919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.373 × 10⁹⁴(95-digit number)
73734093451327139223…88844810871310499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.474 × 10⁹⁵(96-digit number)
14746818690265427844…77689621742620999679
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,710,793 XPM·at block #6,808,341 · 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