Block #257,602

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/12/2013, 1:32:51 PM · Difficulty 9.9758 · 6,559,974 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
17a2efde5ac32482653a55eb98526b8bb4566ed92d8baebd4987777f142f7023

Height

#257,602

Difficulty

9.975847

Transactions

2

Size

458 B

Version

2

Bits

09f9d115

Nonce

16,357

Timestamp

11/12/2013, 1:32:51 PM

Confirmations

6,559,974

Merkle Root

76072f2e3319bcbc0e20c28ae43e9a61c293801c3dcb420e3c260cb56d6c2ddd
Transactions (2)
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.451 × 10⁹⁴(95-digit number)
14518113437461235633…56280897917458848369
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.451 × 10⁹⁴(95-digit number)
14518113437461235633…56280897917458848369
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.903 × 10⁹⁴(95-digit number)
29036226874922471267…12561795834917696739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.807 × 10⁹⁴(95-digit number)
58072453749844942534…25123591669835393479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.161 × 10⁹⁵(96-digit number)
11614490749968988506…50247183339670786959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.322 × 10⁹⁵(96-digit number)
23228981499937977013…00494366679341573919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.645 × 10⁹⁵(96-digit number)
46457962999875954027…00988733358683147839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.291 × 10⁹⁵(96-digit number)
92915925999751908055…01977466717366295679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.858 × 10⁹⁶(97-digit number)
18583185199950381611…03954933434732591359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.716 × 10⁹⁶(97-digit number)
37166370399900763222…07909866869465182719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.433 × 10⁹⁶(97-digit number)
74332740799801526444…15819733738930365439
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,784,659 XPM·at block #6,817,575 · 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