Block #1,241,816

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/18/2015, 6:57:10 AM · Difficulty 10.7555 · 5,603,548 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2565fe15041e82157b49744230a11fd9bd11922409e94af557fae959bd23ba6a

Height

#1,241,816

Difficulty

10.755476

Transactions

3

Size

1.65 KB

Version

2

Bits

0ac166e2

Nonce

726,822,941

Timestamp

9/18/2015, 6:57:10 AM

Confirmations

5,603,548

Merkle Root

1482415094dbfc58289d3c985ca61d74884d71187d163772eb73916af8fbb7a5
Transactions (3)
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.

4.128 × 10⁹⁵(96-digit number)
41284850771986798539…11665838062253941759
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
4.128 × 10⁹⁵(96-digit number)
41284850771986798539…11665838062253941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.256 × 10⁹⁵(96-digit number)
82569701543973597079…23331676124507883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.651 × 10⁹⁶(97-digit number)
16513940308794719415…46663352249015767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.302 × 10⁹⁶(97-digit number)
33027880617589438831…93326704498031534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.605 × 10⁹⁶(97-digit number)
66055761235178877663…86653408996063068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.321 × 10⁹⁷(98-digit number)
13211152247035775532…73306817992126136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.642 × 10⁹⁷(98-digit number)
26422304494071551065…46613635984252272639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.284 × 10⁹⁷(98-digit number)
52844608988143102130…93227271968504545279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.056 × 10⁹⁸(99-digit number)
10568921797628620426…86454543937009090559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.113 × 10⁹⁸(99-digit number)
21137843595257240852…72909087874018181119
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:58,007,356 XPM·at block #6,845,363 · 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.
Privacy Policy·

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