Block #2,463,275

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2018, 9:55:31 AM · Difficulty 10.9579 · 4,361,413 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
930eeb89deb27af7d0a6c0ad7cdb48b6843c45c179d3d55ddc9ce15bc5c7899a

Height

#2,463,275

Difficulty

10.957938

Transactions

48

Size

16.04 KB

Version

2

Bits

0af53b73

Nonce

257,015,441

Timestamp

1/8/2018, 9:55:31 AM

Confirmations

4,361,413

Merkle Root

14baad8327f2a64b7f384a9214f3bd6c6207773ff8cb6820b740c5cfadfbc37c
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.

5.784 × 10⁹⁴(95-digit number)
57847152011267529051…66548866686626308999
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
5.784 × 10⁹⁴(95-digit number)
57847152011267529051…66548866686626308999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.156 × 10⁹⁵(96-digit number)
11569430402253505810…33097733373252617999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.313 × 10⁹⁵(96-digit number)
23138860804507011620…66195466746505235999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.627 × 10⁹⁵(96-digit number)
46277721609014023241…32390933493010471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.255 × 10⁹⁵(96-digit number)
92555443218028046483…64781866986020943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.851 × 10⁹⁶(97-digit number)
18511088643605609296…29563733972041887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.702 × 10⁹⁶(97-digit number)
37022177287211218593…59127467944083775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.404 × 10⁹⁶(97-digit number)
74044354574422437186…18254935888167551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.480 × 10⁹⁷(98-digit number)
14808870914884487437…36509871776335103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.961 × 10⁹⁷(98-digit number)
29617741829768974874…73019743552670207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.923 × 10⁹⁷(98-digit number)
59235483659537949749…46039487105340415999
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,841,562 XPM·at block #6,824,686 · 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