Block #630,717

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/13/2014, 3:45:25 AM · Difficulty 10.9615 · 6,193,941 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42494015fe6771626853b8c68cae65a589803f40e50fa627e8c889ff0f4339ff

Height

#630,717

Difficulty

10.961523

Transactions

3

Size

2.23 KB

Version

2

Bits

0af62659

Nonce

472,231,347

Timestamp

7/13/2014, 3:45:25 AM

Confirmations

6,193,941

Merkle Root

de7d16a589c74b456083be1bf663c6dea879964a16864c03fa4be13e5065d04b
Transactions (3)
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.

9.125 × 10⁹⁴(95-digit number)
91255344044702420107…72212087802319688029
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
9.125 × 10⁹⁴(95-digit number)
91255344044702420107…72212087802319688029
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.825 × 10⁹⁵(96-digit number)
18251068808940484021…44424175604639376059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.650 × 10⁹⁵(96-digit number)
36502137617880968042…88848351209278752119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.300 × 10⁹⁵(96-digit number)
73004275235761936085…77696702418557504239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.460 × 10⁹⁶(97-digit number)
14600855047152387217…55393404837115008479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.920 × 10⁹⁶(97-digit number)
29201710094304774434…10786809674230016959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.840 × 10⁹⁶(97-digit number)
58403420188609548868…21573619348460033919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.168 × 10⁹⁷(98-digit number)
11680684037721909773…43147238696920067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.336 × 10⁹⁷(98-digit number)
23361368075443819547…86294477393840135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.672 × 10⁹⁷(98-digit number)
46722736150887639094…72588954787680271359
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,841,329 XPM·at block #6,824,657 · 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