1. #6,826,7661CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #502,572

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2014, 12:43:23 PM · Difficulty 10.8070 · 6,324,195 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3273bedb0bc4736c067cf8038625477739b4caf29bc5204cfa4db7a12364b0ff

Height

#502,572

Difficulty

10.806992

Transactions

1

Size

697 B

Version

2

Bits

0ace9709

Nonce

131,118

Timestamp

4/20/2014, 12:43:23 PM

Confirmations

6,324,195

Merkle Root

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

8.353 × 10⁹⁴(95-digit number)
83536556308297172821…94438850394341236799
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
8.353 × 10⁹⁴(95-digit number)
83536556308297172821…94438850394341236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.670 × 10⁹⁵(96-digit number)
16707311261659434564…88877700788682473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.341 × 10⁹⁵(96-digit number)
33414622523318869128…77755401577364947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.682 × 10⁹⁵(96-digit number)
66829245046637738256…55510803154729894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.336 × 10⁹⁶(97-digit number)
13365849009327547651…11021606309459788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.673 × 10⁹⁶(97-digit number)
26731698018655095302…22043212618919577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.346 × 10⁹⁶(97-digit number)
53463396037310190605…44086425237839155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.069 × 10⁹⁷(98-digit number)
10692679207462038121…88172850475678310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.138 × 10⁹⁷(98-digit number)
21385358414924076242…76345700951356620799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.277 × 10⁹⁷(98-digit number)
42770716829848152484…52691401902713241599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,858,296 XPM·at block #6,826,766 · 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