Block #671,713

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2014, 11:01:06 AM · Difficulty 10.9644 · 6,136,263 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ff6de57f441f0f6c2c23382a8b03ed946a7842589429508626a67f379c512890

Height

#671,713

Difficulty

10.964421

Transactions

10

Size

2.77 KB

Version

2

Bits

0af6e44c

Nonce

281,401,063

Timestamp

8/10/2014, 11:01:06 AM

Confirmations

6,136,263

Merkle Root

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

1.486 × 10⁹⁷(98-digit number)
14866440028530303526…65918046691455283199
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
1.486 × 10⁹⁷(98-digit number)
14866440028530303526…65918046691455283199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.973 × 10⁹⁷(98-digit number)
29732880057060607052…31836093382910566399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.946 × 10⁹⁷(98-digit number)
59465760114121214104…63672186765821132799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.189 × 10⁹⁸(99-digit number)
11893152022824242820…27344373531642265599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.378 × 10⁹⁸(99-digit number)
23786304045648485641…54688747063284531199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.757 × 10⁹⁸(99-digit number)
47572608091296971283…09377494126569062399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.514 × 10⁹⁸(99-digit number)
95145216182593942566…18754988253138124799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.902 × 10⁹⁹(100-digit number)
19029043236518788513…37509976506276249599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.805 × 10⁹⁹(100-digit number)
38058086473037577026…75019953012552499199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.611 × 10⁹⁹(100-digit number)
76116172946075154053…50039906025104998399
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,707,853 XPM·at block #6,807,975 · 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