Block #274,641

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/26/2013, 9:05:53 AM · Difficulty 9.9582 · 6,552,441 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2dbeb74f6b9c4f7a8a6c01e19db1393cbd8e3cbcb15684c19b76d71269b7b74

Height

#274,641

Difficulty

9.958223

Transactions

1

Size

1.08 KB

Version

2

Bits

09f54e1c

Nonce

177,132

Timestamp

11/26/2013, 9:05:53 AM

Confirmations

6,552,441

Merkle Root

1c80c87e00e51474e24b9e1fb770886ae13992c9dc08d727f546bd7411503b8e
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.

1.672 × 10⁹¹(92-digit number)
16720784112872943541…60787144862664861359
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
1.672 × 10⁹¹(92-digit number)
16720784112872943541…60787144862664861359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.344 × 10⁹¹(92-digit number)
33441568225745887082…21574289725329722719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.688 × 10⁹¹(92-digit number)
66883136451491774165…43148579450659445439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.337 × 10⁹²(93-digit number)
13376627290298354833…86297158901318890879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.675 × 10⁹²(93-digit number)
26753254580596709666…72594317802637781759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.350 × 10⁹²(93-digit number)
53506509161193419332…45188635605275563519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.070 × 10⁹³(94-digit number)
10701301832238683866…90377271210551127039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.140 × 10⁹³(94-digit number)
21402603664477367733…80754542421102254079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.280 × 10⁹³(94-digit number)
42805207328954735466…61509084842204508159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.561 × 10⁹³(94-digit number)
85610414657909470932…23018169684409016319
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,860,841 XPM·at block #6,827,081 · 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