Block #857,922

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 5:03:54 AM · Difficulty 10.9673 · 5,984,825 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6d938a06d2252ccd141f444be15adef5e1648382f74a088a7d30d179b46e3a55

Height

#857,922

Difficulty

10.967275

Transactions

12

Size

2.66 KB

Version

2

Bits

0af79f4f

Nonce

864,948,384

Timestamp

12/18/2014, 5:03:54 AM

Confirmations

5,984,825

Merkle Root

27023d026a56cc2b136f63890040a1f483b2034432adc8081b417eb4dd7edfd0
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.201 × 10⁹³(94-digit number)
22016909315739025255…29201373236143288959
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.201 × 10⁹³(94-digit number)
22016909315739025255…29201373236143288959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.403 × 10⁹³(94-digit number)
44033818631478050511…58402746472286577919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.806 × 10⁹³(94-digit number)
88067637262956101022…16805492944573155839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.761 × 10⁹⁴(95-digit number)
17613527452591220204…33610985889146311679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.522 × 10⁹⁴(95-digit number)
35227054905182440408…67221971778292623359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.045 × 10⁹⁴(95-digit number)
70454109810364880817…34443943556585246719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.409 × 10⁹⁵(96-digit number)
14090821962072976163…68887887113170493439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.818 × 10⁹⁵(96-digit number)
28181643924145952327…37775774226340986879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.636 × 10⁹⁵(96-digit number)
56363287848291904654…75551548452681973759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.127 × 10⁹⁶(97-digit number)
11272657569658380930…51103096905363947519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.254 × 10⁹⁶(97-digit number)
22545315139316761861…02206193810727895039
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,986,312 XPM·at block #6,842,746 · 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