lyj lengyijun

迁移tempfile到sgx中

首先下载源码：

git clone https://github.com/Stebalien/tempfile

忽略windows下的特定依赖。忽视devdependency。 tempfile只有两个依赖remove_dir_all和rand需要处理，所幸这两个依赖都不难处理。

Overview

free to join
not fully p2p. non-relay node connect to relay node
relays / non-relays
join consensus / not join consensus

carpenter -d data 
# you can monitor the consensus process using the carpenter tool for a given node.
# This tool parses the node.log file and prints out details for consensus-related events.

	(** * Merge: Merge Sort, With Specification and Proof of Correctness*)

	From VFA Require Import Perm.
	From VFA Require Import Sort.
	From Coq Require Import Recdef. (* needed for [Function] feature *)

	(** Mergesort is a well-known sorting algorithm, normally presented
	as an imperative algorithm on arrays, that has worst-case
	O(n log n) execution time and requires O(n) auxiliary space.

	open import Data.String as String using (String; fromList)
	open import Data.Nat using (ℕ; zero; suc; _+_; _*_; _<′_; _≤′_)
	open import Data.Nat.Properties
	open import Data.Bool using (Bool; true; false; if_then_else_)
	open import Data.List hiding (merge; partition)
	open import Data.List.Properties using (map-id; map-compose)
	open import Data.Product using (Σ; Σ-syntax; _,_; proj₁; proj₂; _×_; map)
	open import Data.Sum as Sum using (_⊎_; inj₁; inj₂; map)
	open import Data.Unit using (⊤; tt)
	open import Data.Empty using (⊥; ⊥-elim)

	不要用rar压缩.用zip或者tar.gz

	不要把编译后的文件传上来,节省网络中心的压力.一般写一个cpp就够了,很难想象需要.h和其他cpp

	想办法降低复杂度.prime复杂度不到根号n 的都扣了2分
	O(n/2)=O(n),只循环一半没用的

	求个阶乘的事情,不要用递归,效率会很差的.用循环写.随机扣了分

	// Licensed to the Apache Software Foundation (ASF) under one
	// or more contributor license agreements. See the NOTICE file
	// distributed with this work for additional information
	// regarding copyright ownership. The ASF licenses this file
	// to you under the Apache License, Version 2.0 (the
	// "License"); you may not use this file except in compliance
	// with the License. You may obtain a copy of the License at
	//
	// http://www.apache.org/licenses/LICENSE-2.0
	//

	// # Basic Example
	//
	// This example covers the basic functionalities of
	// tantivy.
	//
	// We will :
	// - define our schema
	// - create an index in a directory
	// - index a few documents into our index
	// - search for the best document matching a basic query

	#compdef gtool

	typeset -A opt_args

	_arguments -C \
	'(- 1 *)--help[show usage]' \
	'1: :->cmds'

	case $state in
	cmds)

	<!DOCTYPE html>
	<html>
	<head>
	<title>Login</title>
	</head>

	<body>
	<div class="Login">
	<h1>Validated Login Form</h1>
	<form id="myform" onSubmit="handleSubmit()">