Block #277,381

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 1:30:11 PM · Difficulty 9.9661 · 6,539,583 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0dbf5f505c32bc6e874bdd27194ae9ac643a857d6a37255d7cbcbbb3a959cba0

Height

#277,381

Difficulty

9.966058

Transactions

2

Size

1.27 KB

Version

2

Bits

09f74f9c

Nonce

23,083

Timestamp

11/27/2013, 1:30:11 PM

Confirmations

6,539,583

Merkle Root

ab8962c572a82dc859e0abf944e32cdd17fcc5153bb7af91786cb05d1fb2a907
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.

9.423 × 10⁹¹(92-digit number)
94235777918588078375…53665344811436733259
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
9.423 × 10⁹¹(92-digit number)
94235777918588078375…53665344811436733259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.884 × 10⁹²(93-digit number)
18847155583717615675…07330689622873466519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.769 × 10⁹²(93-digit number)
37694311167435231350…14661379245746933039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.538 × 10⁹²(93-digit number)
75388622334870462700…29322758491493866079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.507 × 10⁹³(94-digit number)
15077724466974092540…58645516982987732159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.015 × 10⁹³(94-digit number)
30155448933948185080…17291033965975464319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.031 × 10⁹³(94-digit number)
60310897867896370160…34582067931950928639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.206 × 10⁹⁴(95-digit number)
12062179573579274032…69164135863901857279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.412 × 10⁹⁴(95-digit number)
24124359147158548064…38328271727803714559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.824 × 10⁹⁴(95-digit number)
48248718294317096128…76656543455607429119
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,779,748 XPM·at block #6,816,963 · 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