Block #281,519

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/29/2013, 1:31:11 AM · Difficulty 9.9772 · 6,543,310 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3342c786c360f87a26a9b977c45e4c4e7fdee2c17960af04d7378af34f66c5a4

Height

#281,519

Difficulty

9.977181

Transactions

1

Size

1.15 KB

Version

2

Bits

09fa288b

Nonce

115,785

Timestamp

11/29/2013, 1:31:11 AM

Confirmations

6,543,310

Merkle Root

61da1f21064a0a16833b42a018446be48b70bcc01152a3d89e2f8b4090e53330
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.667 × 10⁹⁴(95-digit number)
16670632925486261682…58093666430478847999
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.667 × 10⁹⁴(95-digit number)
16670632925486261682…58093666430478847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.334 × 10⁹⁴(95-digit number)
33341265850972523365…16187332860957695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.668 × 10⁹⁴(95-digit number)
66682531701945046731…32374665721915391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.333 × 10⁹⁵(96-digit number)
13336506340389009346…64749331443830783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.667 × 10⁹⁵(96-digit number)
26673012680778018692…29498662887661567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.334 × 10⁹⁵(96-digit number)
53346025361556037385…58997325775323135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.066 × 10⁹⁶(97-digit number)
10669205072311207477…17994651550646271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.133 × 10⁹⁶(97-digit number)
21338410144622414954…35989303101292543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.267 × 10⁹⁶(97-digit number)
42676820289244829908…71978606202585087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.535 × 10⁹⁶(97-digit number)
85353640578489659816…43957212405170175999
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,711 XPM·at block #6,824,828 · 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