Block #846,744

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 8:14:12 PM · Difficulty 10.9722 · 5,996,252 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
33a8a6311473dc301917956e74a37b1161625a37a7c5a2eeb303dc810798c13e

Height

#846,744

Difficulty

10.972153

Transactions

16

Size

3.31 KB

Version

2

Bits

0af8df08

Nonce

239,760,292

Timestamp

12/9/2014, 8:14:12 PM

Confirmations

5,996,252

Merkle Root

ab533c8f15a0fe9165761dacba53c4310cac87fc8a733ca8fa180c266d68334c
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.

6.973 × 10⁹⁴(95-digit number)
69734907752694597035…46082141240333655769
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
6.973 × 10⁹⁴(95-digit number)
69734907752694597035…46082141240333655769
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.394 × 10⁹⁵(96-digit number)
13946981550538919407…92164282480667311539
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.789 × 10⁹⁵(96-digit number)
27893963101077838814…84328564961334623079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.578 × 10⁹⁵(96-digit number)
55787926202155677628…68657129922669246159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.115 × 10⁹⁶(97-digit number)
11157585240431135525…37314259845338492319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.231 × 10⁹⁶(97-digit number)
22315170480862271051…74628519690676984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.463 × 10⁹⁶(97-digit number)
44630340961724542102…49257039381353969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.926 × 10⁹⁶(97-digit number)
89260681923449084205…98514078762707938559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.785 × 10⁹⁷(98-digit number)
17852136384689816841…97028157525415877119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.570 × 10⁹⁷(98-digit number)
35704272769379633682…94056315050831754239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.140 × 10⁹⁷(98-digit number)
71408545538759267364…88112630101663508479
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,988,323 XPM·at block #6,842,995 · 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