Block #530,507

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2014, 10:08:09 PM · Difficulty 10.8924 · 6,276,355 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c302c3565c23fd92ed9ababa85781afc435e061d4771c3547db051b1d8bd1a87

Height

#530,507

Difficulty

10.892363

Transactions

7

Size

1.53 KB

Version

2

Bits

0ae471eb

Nonce

46,501,463

Timestamp

5/7/2014, 10:08:09 PM

Confirmations

6,276,355

Merkle Root

598debb290b06140bb78177a83291b6a5ed05ea956126a40824d4db510913573
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.298 × 10⁹⁹(100-digit number)
42982390562645988107…78826290728116449599
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.298 × 10⁹⁹(100-digit number)
42982390562645988107…78826290728116449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.596 × 10⁹⁹(100-digit number)
85964781125291976214…57652581456232899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.719 × 10¹⁰⁰(101-digit number)
17192956225058395242…15305162912465798399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.438 × 10¹⁰⁰(101-digit number)
34385912450116790485…30610325824931596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.877 × 10¹⁰⁰(101-digit number)
68771824900233580971…61220651649863193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.375 × 10¹⁰¹(102-digit number)
13754364980046716194…22441303299726387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.750 × 10¹⁰¹(102-digit number)
27508729960093432388…44882606599452774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.501 × 10¹⁰¹(102-digit number)
55017459920186864777…89765213198905548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.100 × 10¹⁰²(103-digit number)
11003491984037372955…79530426397811097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.200 × 10¹⁰²(103-digit number)
22006983968074745910…59060852795622195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.401 × 10¹⁰²(103-digit number)
44013967936149491821…18121705591244390399
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,699,002 XPM·at block #6,806,861 · 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