Block #852,015

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2014, 6:21:19 PM · Difficulty 10.9702 · 5,964,897 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eeb304bbd9e4c131b860d9f6b8a85f47822a14879465ea9a223dd8312a9fa11e

Height

#852,015

Difficulty

10.970165

Transactions

3

Size

807 B

Version

2

Bits

0af85cb4

Nonce

1,689,445,283

Timestamp

12/13/2014, 6:21:19 PM

Confirmations

5,964,897

Merkle Root

378308ccbbb5e81a8e338e40d0ba2279b43c3b994392ee0cef838e3544984d1b
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.211 × 10⁹⁶(97-digit number)
12116617627417467870…92904933852982115839
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.211 × 10⁹⁶(97-digit number)
12116617627417467870…92904933852982115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.423 × 10⁹⁶(97-digit number)
24233235254834935740…85809867705964231679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.846 × 10⁹⁶(97-digit number)
48466470509669871481…71619735411928463359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.693 × 10⁹⁶(97-digit number)
96932941019339742963…43239470823856926719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.938 × 10⁹⁷(98-digit number)
19386588203867948592…86478941647713853439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.877 × 10⁹⁷(98-digit number)
38773176407735897185…72957883295427706879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.754 × 10⁹⁷(98-digit number)
77546352815471794370…45915766590855413759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.550 × 10⁹⁸(99-digit number)
15509270563094358874…91831533181710827519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.101 × 10⁹⁸(99-digit number)
31018541126188717748…83663066363421655039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.203 × 10⁹⁸(99-digit number)
62037082252377435496…67326132726843310079
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,779,337 XPM·at block #6,816,911 · 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