Block #739,919

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/25/2014, 3:11:20 AM · Difficulty 10.9793 · 6,090,815 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c480002756404eff9200d588afb6dcedb2e312e3216302814b60c1b922e6f21c

Height

#739,919

Difficulty

10.979269

Transactions

8

Size

2.18 KB

Version

2

Bits

0afab161

Nonce

701,697,375

Timestamp

9/25/2014, 3:11:20 AM

Confirmations

6,090,815

Merkle Root

509411cb141b233ca1737516369a456f383b0047ef663f60cf4eea50b5746d8d
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.619 × 10⁹⁸(99-digit number)
46190402153643487952…65244449760185692159
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.619 × 10⁹⁸(99-digit number)
46190402153643487952…65244449760185692159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.238 × 10⁹⁸(99-digit number)
92380804307286975905…30488899520371384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.847 × 10⁹⁹(100-digit number)
18476160861457395181…60977799040742768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.695 × 10⁹⁹(100-digit number)
36952321722914790362…21955598081485537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.390 × 10⁹⁹(100-digit number)
73904643445829580724…43911196162971074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.478 × 10¹⁰⁰(101-digit number)
14780928689165916144…87822392325942149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.956 × 10¹⁰⁰(101-digit number)
29561857378331832289…75644784651884298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.912 × 10¹⁰⁰(101-digit number)
59123714756663664579…51289569303768596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.182 × 10¹⁰¹(102-digit number)
11824742951332732915…02579138607537192959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.364 × 10¹⁰¹(102-digit number)
23649485902665465831…05158277215074385919
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,890,008 XPM·at block #6,830,733 · 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