Block #850,764

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 6:52:33 PM · Difficulty 10.9710 · 5,992,631 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
75ebd09440a1642d13e37229f27e93e3c24188f37dbd442b0dd1ba62fbd5772c

Height

#850,764

Difficulty

10.971049

Transactions

10

Size

2.48 KB

Version

2

Bits

0af896af

Nonce

1,155,023,019

Timestamp

12/12/2014, 6:52:33 PM

Confirmations

5,992,631

Merkle Root

2862781e8d4ad0d9a9fc07d722dad65f86d0c0560ecb5cecbbf256d10bb577b5
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.

4.964 × 10⁹⁷(98-digit number)
49643760392142102655…11154619855937198079
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
4.964 × 10⁹⁷(98-digit number)
49643760392142102655…11154619855937198079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.928 × 10⁹⁷(98-digit number)
99287520784284205310…22309239711874396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.985 × 10⁹⁸(99-digit number)
19857504156856841062…44618479423748792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.971 × 10⁹⁸(99-digit number)
39715008313713682124…89236958847497584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.943 × 10⁹⁸(99-digit number)
79430016627427364248…78473917694995169279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.588 × 10⁹⁹(100-digit number)
15886003325485472849…56947835389990338559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.177 × 10⁹⁹(100-digit number)
31772006650970945699…13895670779980677119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.354 × 10⁹⁹(100-digit number)
63544013301941891398…27791341559961354239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.270 × 10¹⁰⁰(101-digit number)
12708802660388378279…55582683119922708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.541 × 10¹⁰⁰(101-digit number)
25417605320776756559…11165366239845416959
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,991,524 XPM·at block #6,843,394 · 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