Block #847,628

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2014, 12:04:25 PM · Difficulty 10.9718 · 5,994,729 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a080d3b754558e85e406082b771a7df35139a2e435e6a32c696cbf7e3dc8eddf

Height

#847,628

Difficulty

10.971807

Transactions

10

Size

2.18 KB

Version

2

Bits

0af8c85d

Nonce

950,615,559

Timestamp

12/10/2014, 12:04:25 PM

Confirmations

5,994,729

Merkle Root

91ed5f1570010209c2ed41b3f661cbc050bd07aeeb368ac6888cd6d3303b7ddc
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.315 × 10⁹³(94-digit number)
23150578455278943173…79662668620363234879
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.315 × 10⁹³(94-digit number)
23150578455278943173…79662668620363234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.630 × 10⁹³(94-digit number)
46301156910557886347…59325337240726469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.260 × 10⁹³(94-digit number)
92602313821115772695…18650674481452939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.852 × 10⁹⁴(95-digit number)
18520462764223154539…37301348962905879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.704 × 10⁹⁴(95-digit number)
37040925528446309078…74602697925811758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.408 × 10⁹⁴(95-digit number)
74081851056892618156…49205395851623516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.481 × 10⁹⁵(96-digit number)
14816370211378523631…98410791703247032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.963 × 10⁹⁵(96-digit number)
29632740422757047262…96821583406494064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.926 × 10⁹⁵(96-digit number)
59265480845514094525…93643166812988129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.185 × 10⁹⁶(97-digit number)
11853096169102818905…87286333625976258559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.370 × 10⁹⁶(97-digit number)
23706192338205637810…74572667251952517119
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,983,263 XPM·at block #6,842,356 · 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