Block #277,530

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 2:53:04 PM · Difficulty 9.9665 · 6,547,291 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
88bd3c01c165436df42873f77c915f642d5c0bbd34ff3248b0e03a5231214375

Height

#277,530

Difficulty

9.966507

Transactions

4

Size

3.28 KB

Version

2

Bits

09f76d05

Nonce

744

Timestamp

11/27/2013, 2:53:04 PM

Confirmations

6,547,291

Merkle Root

48f018fb8d10af918e89101dfccbae3536ed461a5d5a033ed7f3b5446849aaae
Transactions (4)
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.744 × 10⁹⁴(95-digit number)
17446802283351048801…02659519119604902799
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.744 × 10⁹⁴(95-digit number)
17446802283351048801…02659519119604902799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.489 × 10⁹⁴(95-digit number)
34893604566702097603…05319038239209805599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.978 × 10⁹⁴(95-digit number)
69787209133404195207…10638076478419611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.395 × 10⁹⁵(96-digit number)
13957441826680839041…21276152956839222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.791 × 10⁹⁵(96-digit number)
27914883653361678083…42552305913678444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.582 × 10⁹⁵(96-digit number)
55829767306723356166…85104611827356889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.116 × 10⁹⁶(97-digit number)
11165953461344671233…70209223654713779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.233 × 10⁹⁶(97-digit number)
22331906922689342466…40418447309427558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.466 × 10⁹⁶(97-digit number)
44663813845378684932…80836894618855116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.932 × 10⁹⁶(97-digit number)
89327627690757369865…61673789237710233599
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,842,646 XPM·at block #6,824,820 · 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