Block #277,079

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 10:47:58 AM · Difficulty 9.9651 · 6,539,596 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0348241f09385607369617f3c727b9feb13ff7d87c85317bc199bd6de8b4cdcc

Height

#277,079

Difficulty

9.965089

Transactions

2

Size

3.45 KB

Version

2

Bits

09f71019

Nonce

31,567

Timestamp

11/27/2013, 10:47:58 AM

Confirmations

6,539,596

Merkle Root

bd2f47e9ca3dc8c6fb90ed73d0a97aef21cb2546da8c28126b977f05c8fe9078
Transactions (2)
1 in → 1 out10.1100 XPM109 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.139 × 10⁹¹(92-digit number)
21394628858463472536…74892462507862680299
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.139 × 10⁹¹(92-digit number)
21394628858463472536…74892462507862680299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.278 × 10⁹¹(92-digit number)
42789257716926945073…49784925015725360599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.557 × 10⁹¹(92-digit number)
85578515433853890146…99569850031450721199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.711 × 10⁹²(93-digit number)
17115703086770778029…99139700062901442399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.423 × 10⁹²(93-digit number)
34231406173541556058…98279400125802884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.846 × 10⁹²(93-digit number)
68462812347083112116…96558800251605769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.369 × 10⁹³(94-digit number)
13692562469416622423…93117600503211539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.738 × 10⁹³(94-digit number)
27385124938833244846…86235201006423078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.477 × 10⁹³(94-digit number)
54770249877666489693…72470402012846156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.095 × 10⁹⁴(95-digit number)
10954049975533297938…44940804025692313599
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,777,519 XPM·at block #6,816,674 · 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