Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Plane coordinate system-based block chain data management method for virtual parcel

A plane coordinate system and data management technology, applied in data processing applications, electrical digital data processing, digital data protection, etc., can solve problems such as game and application network attacks, and achieve the effect of reducing data concurrency and increasing

Inactive Publication Date: 2018-09-07
重庆强阳科技有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] In the construction of the structural framework of mobile games and applications, the central server occupies a very important position. It not only handles a large number of calculations, but also must store a large amount of game and application-related data. However, once the official server is attacked and cracked, the official data will be destroyed. Tampering will bring a devastating blow to the entire game and application network

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Plane coordinate system-based block chain data management method for virtual parcel
  • Plane coordinate system-based block chain data management method for virtual parcel
  • Plane coordinate system-based block chain data management method for virtual parcel

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0055] Example 1: Square virtual surface:

[0056] Custom assumption: max_X=max_Y=180; assumption level: Level=17;

[0057] Take the coordinate A(x, y) in the virtual surface as (106.508084, 29.536231); obtain (tileX, tileY) through the formula as (104314, 76289); customize the number according to the result: YC001

[0058] Take the coordinates B(x, y) that are relatively close to the straight line distance as (106.508382, 29.535712), and get (tileX, tileY) as (104314, 76289) through the formula; according to the results, it can be concluded that the (tileX, tileY) of the two points ) are the same, so it is determined that points A and B are divided into the same small virtual plot.

[0059] Take the coordinate C(x, y) with a relatively far distance from the straight line as (106.511142, 29.53815), and use the formula to get (tileX, tileY) as (104315, 76290)

[0060] According to the results, points A and C are divided into different small virtual plots, such as image 3 sh...

example 2

[0061] Example 2: Rectangular virtual surface:

[0062] Custom assumptions: max_X=180; max_Y=100;

[0063] Suppose the division level: level=17.

[0064] Take the coordinate D(x,y) in the virtual surface as (106.508084,29.536231);

[0065] We get (tileX, tileY) as (104314, 84892) through the formula; according to the result, we customize the number: YC002

[0066] Take the coordinate F(x, y) that is relatively close to the straight line distance as (106.508382, 29.535712), and get (tileX, tileY) as (104314, 84892) through the formula; according to the results, it is determined that points D and F are divided into the same small virtual ground piece.

[0067] Take the coordinates G(x, y) with a relatively long straight line distance as (106.511142, 29.53815), and get (tileX, tileY) as (104315, 84894) through the formula; according to the results, it is determined that points D and G are divided into different small virtual grounds block, such as Figure 4 shown.

[0068] ...

example 3

[0117] Assume that because the block will be generated periodically, but the time for each node to record the block (original) is uncertain, so when it is recorded on the main chain, the recorded block may already have multiple recorded branch chains, Therefore, when a node obtains the right to record blocks at the same time, the branch chain with the most blocks and the transaction content of the block will be truly recognized as "valid", and the shorter branch chain and the transaction content of the block will be Will be directly regarded as "unconfirmed" and wait for re-authentication. Used to prevent blockchain forks. ( Figure 9 )

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a plane coordinate system-based block chain data management method for a virtual parcel. The block chain data management method comprises virtual parcel division and virtual parcel trading. Through plane coordinate system-based virtual parcel division and block chain data management, trading data management of the virtual parcel gets rid of a "centralization" characteristic; all nodes have effective accurate data and reach a consensus; and even if a central server is subjected to crushing blow such as attack, tampering and the like, the trading data can be quickly retrieved. Moreover, the problem of concurrent increment of various data caused by connection between each node and the server is greatly reduced.

Description

technical field [0001] The invention relates to a digital virtual surface management method. Background technique [0002] In the construction of the structural framework of mobile games and applications, the central server occupies a very important position. It not only handles a large number of calculations, but also must store a large amount of game and application-related data. However, once the official server is attacked and cracked, the official data will be destroyed. Tampering will bring a devastating blow to the entire game and application network. Contents of the invention [0003] The purpose of the present invention is to provide a block chain data management method based on a plane coordinate system of a virtual plot. [0004] In order to achieve the above purpose, the following technical solutions are adopted: [0005] A block chain data management method for a virtual plot based on a plane coordinate system, characterized in that: the method includes cons...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F21/64G06F21/60G06Q40/04
CPCG06F21/602G06F21/64G06Q40/04
Inventor 张同向波李靖刘杰李成
Owner 重庆强阳科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com