Block #848,490

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2014, 3:10:52 AM · Difficulty 10.9716 · 5,996,874 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd8b7b315004cc4dd2c53d81e00b492929960f77cfb580e7658492141fb1fd88

Height

#848,490

Difficulty

10.971581

Transactions

11

Size

2.50 KB

Version

2

Bits

0af8b983

Nonce

1,254,054,434

Timestamp

12/11/2014, 3:10:52 AM

Confirmations

5,996,874

Merkle Root

c6daef5c5cf31610fcf9bc5e906e5e595b81445638c41a9abb61b90abdf950bd
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.411 × 10⁹²(93-digit number)
44116378693049820990…76122114689226148279
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.411 × 10⁹²(93-digit number)
44116378693049820990…76122114689226148279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.823 × 10⁹²(93-digit number)
88232757386099641981…52244229378452296559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.764 × 10⁹³(94-digit number)
17646551477219928396…04488458756904593119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.529 × 10⁹³(94-digit number)
35293102954439856792…08976917513809186239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.058 × 10⁹³(94-digit number)
70586205908879713585…17953835027618372479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.411 × 10⁹⁴(95-digit number)
14117241181775942717…35907670055236744959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.823 × 10⁹⁴(95-digit number)
28234482363551885434…71815340110473489919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.646 × 10⁹⁴(95-digit number)
56468964727103770868…43630680220946979839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.129 × 10⁹⁵(96-digit number)
11293792945420754173…87261360441893959679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.258 × 10⁹⁵(96-digit number)
22587585890841508347…74522720883787919359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.517 × 10⁹⁵(96-digit number)
45175171781683016694…49045441767575838719
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:58,007,356 XPM·at block #6,845,363 · 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