Block #232,696

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/29/2013, 7:05:04 AM · Difficulty 9.9412 · 6,576,996 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4f6f515c63ca7f64ca4025252275844b7849602190328811099453fe56a274ac

Height

#232,696

Difficulty

9.941207

Transactions

5

Size

2.31 KB

Version

2

Bits

09f0f2f2

Nonce

107,939

Timestamp

10/29/2013, 7:05:04 AM

Confirmations

6,576,996

Merkle Root

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

5.100 × 10⁹²(93-digit number)
51007769019895460541…80380879858595316639
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
5.100 × 10⁹²(93-digit number)
51007769019895460541…80380879858595316639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.020 × 10⁹³(94-digit number)
10201553803979092108…60761759717190633279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.040 × 10⁹³(94-digit number)
20403107607958184216…21523519434381266559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.080 × 10⁹³(94-digit number)
40806215215916368433…43047038868762533119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.161 × 10⁹³(94-digit number)
81612430431832736867…86094077737525066239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.632 × 10⁹⁴(95-digit number)
16322486086366547373…72188155475050132479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.264 × 10⁹⁴(95-digit number)
32644972172733094746…44376310950100264959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.528 × 10⁹⁴(95-digit number)
65289944345466189493…88752621900200529919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.305 × 10⁹⁵(96-digit number)
13057988869093237898…77505243800401059839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.611 × 10⁹⁵(96-digit number)
26115977738186475797…55010487600802119679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.223 × 10⁹⁵(96-digit number)
52231955476372951594…10020975201604239359
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,721,612 XPM·at block #6,809,691 · 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.

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