Block #857,237

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 4:54:48 PM · Difficulty 10.9675 · 5,985,073 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fb77ab7980cc0de77e283a949e8b69104cdd76326d39441ad3fbd744f480e076

Height

#857,237

Difficulty

10.967536

Transactions

3

Size

651 B

Version

2

Bits

0af7b076

Nonce

293,012,817

Timestamp

12/17/2014, 4:54:48 PM

Confirmations

5,985,073

Merkle Root

078947949d5a07209ef981cf9260d0f1c5f1d7665aa00dd89f3696d739320073
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.269 × 10⁹⁵(96-digit number)
12691165609994964640…11043013827467502079
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.269 × 10⁹⁵(96-digit number)
12691165609994964640…11043013827467502079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.538 × 10⁹⁵(96-digit number)
25382331219989929280…22086027654935004159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.076 × 10⁹⁵(96-digit number)
50764662439979858561…44172055309870008319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.015 × 10⁹⁶(97-digit number)
10152932487995971712…88344110619740016639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.030 × 10⁹⁶(97-digit number)
20305864975991943424…76688221239480033279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.061 × 10⁹⁶(97-digit number)
40611729951983886849…53376442478960066559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.122 × 10⁹⁶(97-digit number)
81223459903967773698…06752884957920133119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.624 × 10⁹⁷(98-digit number)
16244691980793554739…13505769915840266239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.248 × 10⁹⁷(98-digit number)
32489383961587109479…27011539831680532479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.497 × 10⁹⁷(98-digit number)
64978767923174218958…54023079663361064959
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,982,886 XPM·at block #6,842,309 · 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