Block #1,354,846

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2015, 12:06:10 AM · Difficulty 10.8087 · 5,454,201 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b186f02d98f782a37fb514868618f4c3f781198c1b99e450918e9392a9d3ea5f

Height

#1,354,846

Difficulty

10.808657

Transactions

2

Size

27.57 KB

Version

2

Bits

0acf0422

Nonce

351,860,700

Timestamp

12/5/2015, 12:06:10 AM

Confirmations

5,454,201

Merkle Root

274890b0fa50e1b0674e5a66d26ba198cff4b85d1c644c47149890b96dd01765
Transactions (2)
1 in → 1 out8.8800 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.

7.965 × 10⁹¹(92-digit number)
79651168563219898428…96809307035311134699
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
7.965 × 10⁹¹(92-digit number)
79651168563219898428…96809307035311134699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.593 × 10⁹²(93-digit number)
15930233712643979685…93618614070622269399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.186 × 10⁹²(93-digit number)
31860467425287959371…87237228141244538799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.372 × 10⁹²(93-digit number)
63720934850575918742…74474456282489077599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.274 × 10⁹³(94-digit number)
12744186970115183748…48948912564978155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.548 × 10⁹³(94-digit number)
25488373940230367496…97897825129956310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.097 × 10⁹³(94-digit number)
50976747880460734993…95795650259912620799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.019 × 10⁹⁴(95-digit number)
10195349576092146998…91591300519825241599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.039 × 10⁹⁴(95-digit number)
20390699152184293997…83182601039650483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.078 × 10⁹⁴(95-digit number)
40781398304368587995…66365202079300966399
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,716,440 XPM·at block #6,809,046 · 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