Block #1,860,310

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/21/2016, 11:35:50 PM · Difficulty 10.6885 · 4,971,082 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e502056378e163443ac6fa4a2994a1789d55962ee24706d57ae7582f98830faa

Height

#1,860,310

Difficulty

10.688526

Transactions

3

Size

3.75 KB

Version

2

Bits

0ab0433f

Nonce

1,562,737,747

Timestamp

11/21/2016, 11:35:50 PM

Confirmations

4,971,082

Merkle Root

9a4d4443320f6f263c7688db1b787bd4419e270967e94c857498e8cad660b770
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.

3.473 × 10⁹⁴(95-digit number)
34731117650653319992…95753165097020142559
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
3.473 × 10⁹⁴(95-digit number)
34731117650653319992…95753165097020142559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.946 × 10⁹⁴(95-digit number)
69462235301306639984…91506330194040285119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.389 × 10⁹⁵(96-digit number)
13892447060261327996…83012660388080570239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.778 × 10⁹⁵(96-digit number)
27784894120522655993…66025320776161140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.556 × 10⁹⁵(96-digit number)
55569788241045311987…32050641552322280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.111 × 10⁹⁶(97-digit number)
11113957648209062397…64101283104644561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.222 × 10⁹⁶(97-digit number)
22227915296418124795…28202566209289123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.445 × 10⁹⁶(97-digit number)
44455830592836249590…56405132418578247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.891 × 10⁹⁶(97-digit number)
88911661185672499180…12810264837156495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.778 × 10⁹⁷(98-digit number)
17782332237134499836…25620529674312990719
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,895,292 XPM·at block #6,831,391 · 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