Block #277,427

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 1:51:45 PM · Difficulty 9.9662 · 6,547,215 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3ceb3d367bc3df8741fa90d7fae589b4c2bd3e5ea6c26b7ab1a270392aa2faf7

Height

#277,427

Difficulty

9.966221

Transactions

1

Size

1.08 KB

Version

2

Bits

09f75a41

Nonce

26,462

Timestamp

11/27/2013, 1:51:45 PM

Confirmations

6,547,215

Merkle Root

874beb4eac0bb7d1c4539af49b313bd3bf601130c225f32f7642d2e8501475a2
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.243 × 10⁹⁰(91-digit number)
82431764386882429712…52043988892910160999
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.243 × 10⁹⁰(91-digit number)
82431764386882429712…52043988892910160999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.648 × 10⁹¹(92-digit number)
16486352877376485942…04087977785820321999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.297 × 10⁹¹(92-digit number)
32972705754752971885…08175955571640643999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.594 × 10⁹¹(92-digit number)
65945411509505943770…16351911143281287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.318 × 10⁹²(93-digit number)
13189082301901188754…32703822286562575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.637 × 10⁹²(93-digit number)
26378164603802377508…65407644573125151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.275 × 10⁹²(93-digit number)
52756329207604755016…30815289146250303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.055 × 10⁹³(94-digit number)
10551265841520951003…61630578292500607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.110 × 10⁹³(94-digit number)
21102531683041902006…23261156585001215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.220 × 10⁹³(94-digit number)
42205063366083804012…46522313170002431999
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,841,200 XPM·at block #6,824,641 · 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