Block #287,957

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/1/2013, 1:09:28 PM · Difficulty 9.9872 · 6,537,644 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aa6c537ae4017b2d65318953c64b1788dc05b3304b3db2b06a98b903d773db3c

Height

#287,957

Difficulty

9.987217

Transactions

3

Size

18.40 KB

Version

2

Bits

09fcba47

Nonce

33,799

Timestamp

12/1/2013, 1:09:28 PM

Confirmations

6,537,644

Merkle Root

dfe239c01cac0e40e523180b9a2b57b931936377ecd12fc3616bebaabb9432a2
Transactions (3)
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.

2.420 × 10⁹⁸(99-digit number)
24206505496238751057…31671453711130324479
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
2.420 × 10⁹⁸(99-digit number)
24206505496238751057…31671453711130324479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.841 × 10⁹⁸(99-digit number)
48413010992477502115…63342907422260648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.682 × 10⁹⁸(99-digit number)
96826021984955004231…26685814844521297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.936 × 10⁹⁹(100-digit number)
19365204396991000846…53371629689042595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.873 × 10⁹⁹(100-digit number)
38730408793982001692…06743259378085191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.746 × 10⁹⁹(100-digit number)
77460817587964003385…13486518756170383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.549 × 10¹⁰⁰(101-digit number)
15492163517592800677…26973037512340766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.098 × 10¹⁰⁰(101-digit number)
30984327035185601354…53946075024681533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.196 × 10¹⁰⁰(101-digit number)
61968654070371202708…07892150049363066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.239 × 10¹⁰¹(102-digit number)
12393730814074240541…15784300098726133759
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,848,909 XPM·at block #6,825,600 · 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